✦ LIBER ✦

New Approximation Algorithms for Minimum Cycle Bases of Graphs

✍ Scribed by Telikepalli Kavitha; Kurt Mehlhorn; Dimitrios Michail

Publisher: Springer
Year: 2009
Tongue: English
Weight: 517 KB
Volume: 59
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-009-9313-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum Cycle Bases for Network Graphs

✍ Franziska Berger; Peter Gritzmann; Sven de Vries 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 233 KB

Minimum cycle bases of Halin graphs

✍ Peter F. Stadler 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 90 KB

## Abstract Halin graphs are planar 3‐connected graphs that consist of a tree and a cycle connecting the end vertices of the tree. It is shown that all Halin graphs that are not “necklaces” have a unique minimum cycle basis. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 150–155, 2003

A parallel algorithm for approximating t

A parallel algorithm for approximating the minimum cycle cover

✍ Philip Klein; Clifford Stein 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 694 KB

Approximation Algorithm Based on Chain I

Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs

✍ Jian-Xin Wang; Xiao-Shuang Xu; Jian-Er Chen 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 315 KB

New polynomial-time cycle-canceling algo

New polynomial-time cycle-canceling algorithms for minimum-cost flows

✍ P. T. Sokkalingam; Ravindra K. Ahuja; James B. Orlin 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 227 KB

Cycle bases of graphs for sparse flexibi

Cycle bases of graphs for sparse flexibility matrices

✍ A. Kaveh; G.R. Roosta 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 200 KB

An ecient algorithm is presented for the formation of cycle bases of graphs corresponding to sparse cyclemember incidence matrices, leading to the formation of highly sparse ¯exibility matrices. The algorithm presented employs a new expansion process and uses an ecient graph-theoretical method for c