✦ LIBER ✦

An Algorithm for Determining Whether the Connectivity of a Graph is at Least k

✍ Scribed by Even, Shimon

Book ID: 118161176
Publisher: Society for Industrial and Applied Mathematics
Year: 1975
Tongue: English
Weight: 455 KB
Volume: 4
Category: Article
ISSN: 0097-5397
DOI: 10.1137/0204034

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Algorithm for Determining the Chromat

An Algorithm for Determining the Chromatic Number of a Graph

✍ Corneil, D. G.; Graham, B. 📂 Article 📅 1973 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 633 KB

An n2 algorithm for determining the brid

An n2 algorithm for determining the bridges of a graph

✍ D.G. Corneil 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 546 KB

An excluding algorithm for testing wheth

An excluding algorithm for testing whether a family of graphs are determined by their generalized spectra

✍ Wei Wang; Cheng-Xian Xu 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 193 KB

An algorithm for the determination of lo

An algorithm for the determination of longest distances in a graph

✍ Hartmut Noltemeier 📂 Article 📅 1975 🏛 Springer-Verlag 🌐 English ⚖ 350 KB

An algorithm for construction of a k-con

An algorithm for construction of a k-connected graph with minimum number of edges and quasiminimal diameter

✍ Ulrich Schumacher 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 470 KB

Two fundamental considerations in the design of a communication network are reliability and maximum transmission delay. In this paper we give an algorithm for construction of an undirected graph with n vertices in which there are k node-disjoint paths between any two nodes. The generated graphs will

A proof of unimodality on the numbers of

A proof of unimodality on the numbers of connected spanning subgraphs in an -vertex graph with at least edges

✍ Peng Cheng; Shigeru Masuyama 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 721 KB