✦ LIBER ✦

On finding all unilaterally connected components of a digraph

✍ Scribed by Eshrat Arjomandi

Book ID: 113161887
Publisher: Elsevier Science
Year: 1976
Tongue: English
Weight: 374 KB
Volume: 5
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(76)90093-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for finding a minimal equiv

An algorithm for finding a minimal equivalent graph of a strongly connected digraph

✍ S. Martello 📂 Article 📅 1979 🏛 Springer Vienna 🌐 English ⚖ 505 KB

On finding the strongly connected compon

On finding the strongly connected components in a directed graph

✍ Esko Nuutila; Eljas Soisalon-Soininen 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 499 KB

Increasing the rooted-connectivity of a

Increasing the rooted-connectivity of a digraph by one

✍ András Frank 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 92 KB

On the problem of finding disjoint cycle

On the problem of finding disjoint cycles and dicycles in a digraph

✍ Jørgen Bang-Jensen; Matthias Kriesell 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 372 KB

On the sum of all distances in a graph o

On the sum of all distances in a graph or digraph

✍ Ján Plesník 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 870 KB

The transmission of a graph or digraph G is the sum of all distances in G. StFict bounds on the transmission are collected and extended for several classes of graphs and digraphs. For example, in the class of 2connected or Z-edge-mnnected graphs of order n, the maximal transmission is realized only

Finding all the hamiltonian paths of a g

Finding all the hamiltonian paths of a graph and investigation of hamiltonian-connected graphs

✍ V.P. Kozyrev 📂 Article 📅 1976 🏛 Elsevier Science ⚖ 700 KB