Period of time: 2004年1期
Publisher: Academic Press
Founded in: 1980
Total resources: 32
ISSN: 0196-6774
Subject: O Mathematical Sciences and Chemical
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Journal of Algorithms,volume 32,issue 1
Menu
Lower Bounds for the Complexity of Functions in a Realistic RAM Model
Journal of Algorithms,volume 32,issue 1 , Vol. 32, Iss. 1, 1999-07 , pp.A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
By Auletta V.,Dinitz Y.,Nutov Z.,Parente D. in (1999)
Journal of Algorithms,volume 32,issue 1 , Vol. 32, Iss. 1, 1999-07 , pp.A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs
By Dinitz Y.,Nutov Z. in (1999)
Journal of Algorithms,volume 32,issue 1 , Vol. 32, Iss. 1, 1999-07 , pp.Approximating the Bandwidth for Asteroidal Triple-Free Graphs
By Kloks T.,Kratsch D.,Müller H. in (1999)
Journal of Algorithms,volume 32,issue 1 , Vol. 32, Iss. 1, 1999-07 , pp.Bases for Polynomial Invariants of Conjugates of Permutation Groups
By Khuller S.,Göbel M.,Walter J. in (1999)
Journal of Algorithms,volume 32,issue 1 , Vol. 32, Iss. 1, 1999-07 , pp.Papers to Appear in Forthcoming Issues
Journal of Algorithms,volume 32,issue 1 , Vol. 32, Iss. 1, 1999-07 , pp.