✦ LIBER ✦

Counting the number of minimum cuts in undirected multigraphs

✍ Scribed by Nagamochi, H.; Sun, Z.; Ibaraki, T.

Book ID: 114555002
Publisher: IEEE
Year: 1991
Tongue: English
Weight: 454 KB
Volume: 40
Category: Article
ISSN: 0018-9529
DOI: 10.1109/24.106785

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Counting the number of minimum cuts in u

Counting the number of minimum cuts in undirected multigraphs : Hiroshi Nagamochi et al. IEEE Trans. Reliab. 40, 610 (1991)

📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 134 KB

On the Number of Minimum Cuts in a Graph

✍ Chandran, L. Sunil; Ram, L. Shankar 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 253 KB

An exact lower bound on the number of cu

An exact lower bound on the number of cut-sets in multigraphs

✍ Hideaki Harada; Zheng Sun; Hiroshi Nagamochi 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 903 KB

Graphs with the smallest number of minim

Graphs with the smallest number of minimum cut sets

✍ Derek Smith 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 630 KB

The number of cut-vertices in a graph of

The number of cut-vertices in a graph of given minimum degree

✍ Michael O. Albertson; David M. Berman 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 228 KB

Albertson, M.O. and D.M. Berman, The number of cut-vertices in a graph of given minimum degree, Discrete Mathematics 89 (1991) 97-100. A graph with n vertices and minimum degree k 2 2 can contain no more than (2k -2)n/(kz -2) cut-vertices. This bound is asymptotically tight. \* Research supported in

On the number of small cuts in a graph

✍ Monika Henzinger; David P. Williamson 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 356 KB