New Approximation Algorithms for Minimum Cycle Bases of Graphs

Author： Kavitha Telikepalli   Mehlhorn Kurt   Michail Dimitrios  

Publisher： Springer Publishing Company

ISSN： 0178-4617

Source： Algorithmica, Vol.59, Iss.4, 2011-04, pp. : 471-488

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Minimum Cycle Bases for Network Graphs

By Berger Franziska   Gritzmann Peter   Vries Sven  

Algorithmica, Vol. 40, Iss. 1, 2004-06 ,pp. : 51-62

Springer Publishing Company

Access to resources Recommend Favorite

Minimum Weakly Fundamental Cycle Bases Are Hard To Find

By Rizzi Romeo  

Algorithmica, Vol. 53, Iss. 3, 2009-03 ,pp. : 402-424

Springer Publishing Company

Access to resources Recommend Favorite

Efficient algorithms for a mixed k-partition problem of graphs without specifying bases

By Wada K.   Takaki A.   Kawaguchi K.  

Theoretical Computer Science, Vol. 201, Iss. 1, 1998-07 ,pp. : 233-248

Elsevier

Access to resources Recommend Favorite

Linear-time algorithms for parametric minimum spanning tree problems on planar graphs

By Fernandez-Baca D.   Slutzki G.  

Theoretical Computer Science, Vol. 181, Iss. 1, 1997-07 ,pp. : 57-74

Elsevier

Access to resources Recommend Favorite

Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms

By Chen J.   Kanj I.A.  

Journal of Computer and System Sciences, Vol. 67, Iss. 4, 2003-12 ,pp. : 833-847

Elsevier

Access to resources Recommend Favorite