✦ LIBER ✦

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

✍ Scribed by S. Martello

Publisher: Springer Vienna
Year: 1979
Tongue: English
Weight: 505 KB
Volume: 21
Category: Article
ISSN: 0010-485X
DOI: 10.1007/bf02253052

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding a minimum equivalent graph of a

Finding a minimum equivalent graph of a digraph

✍ Silvano Martello; Paolo Toth 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 537 KB

An optimal algorithm for the period of a

An optimal algorithm for the period of a strongly connected digraph

✍ Adriano Pascoletti 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 393 KB

Efficient systolic algorithm for finding

Efficient systolic algorithm for finding bridges in a connected graph

✍ M Zubair; B.B Madan 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 472 KB

A fully-pipelined systolic algorithm for

A fully-pipelined systolic algorithm for finding bridges on an undirected connected graph

✍ Su-Chu Hsu; Hsien-Fen Hsieh; Shing-Tsaan Huang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 905 KB

A linear-time algorithm for finding a sp

A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graph

✍ Hiroshi Nagamochi; Toshihide Ibaraki 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 684 KB

On the decomposition of a minimally stro

On the decomposition of a minimally strongly h-connected digraph into h+1 acircuitic sub-graphs

✍ Yahya Ould Hamidoune 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 119 KB

We prove that every minimally strongly h-connected digraph can be decomposed into h + 1 acircuitic subgraphs. This result generalizes the following theorem of Mader. Every minimally h-connected graph is h + 1 colourable,