✦ LIBER ✦

Minimum Cycle Bases for Network Graphs

✍ Scribed by Franziska Berger; Peter Gritzmann; Sven de Vries

Publisher: Springer
Year: 2004
Tongue: English
Weight: 233 KB
Volume: 40
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-004-1098-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

New Approximation Algorithms for Minimum

New Approximation Algorithms for Minimum Cycle Bases of Graphs

✍ Telikepalli Kavitha; Kurt Mehlhorn; Dimitrios Michail 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 517 KB

Minimum cycle covers of graphs

✍ Fan, Genghua 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 145 KB 👁 1 views

Some new results on minimum cycle covers are proved. As a consequence, it is obtained that the edges of a bridgeless graph G can be covered by cycles of total length at most |E(G)| + 25 24 (|V (G)| -1), and at most |E(G)| + |V (G)| -1 if G contains no circuit of length 8 or 12.

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

Cycle-saturated graphs of minimum size

✍ C.A. Barefoot; L.H. Clark; R.C. Entringer; T.D. Porter; L.A. Székely; Zs. Tuza 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 707 KB

A graph G is called Ck-saturated if G contains no cycles of length k but does contain such a cycle after the addition of any new edge. Bounds are obtained for the minimum number of edges in Ck-saturated graphs for all k ~ 8 or 10 and n sufficiently large. In general, it is shown that the minimum is

Minimum bandwidth problem for embedding

Minimum bandwidth problem for embedding graphs in cycles

✍ Lin, Yixun 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 98 KB 👁 2 views

For the bandwidth B(G) and the cyclic bandwidth B c (G) of a graph G, it is known that 1 2 B(G) °Bc (G) °B(G). In this paper, the criterion conditions for two extreme cases B c (G) Å B(G) and B c (G) Å 1 2 B(G) are studied. From this, some exact values of B c (G) for special graphs can be obtained.