✦ LIBER ✦

Parallel strong orientation of an undirected graph

✍ Scribed by Mikhail J. Atallah

Book ID: 113162683
Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 290 KB
Volume: 18
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(84)90072-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An optimal parallel processor bound in s

An optimal parallel processor bound in strong orientation of an undirected graph

✍ Yung Hyang Tsin 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 236 KB

An edge-oriented adjacency list for undi

An edge-oriented adjacency list for undirected graphs

✍ L. K. Chen; B. S. Ting; A. Sangiovanni-Vincentelli 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 416 KB

A note on k-strongly connected orientati

A note on k-strongly connected orientations of an undirected graph

✍ András Frank 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 168 KB

Each k-strongly connected orientation of an undirect:7d I.&P A \_an be obtained from any other k-strongly connected orientation by reversing consec aLir :!I 3irected paths or circuits without destroying the k-strong connectivity.

Enumeration of minimal cutsets of an und

Enumeration of minimal cutsets of an undirected graph

✍ S.Hasanuddin Ahmad 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 249 KB

Algorithm 457: finding all cliques of an

Algorithm 457: finding all cliques of an undirected graph

✍ Bron, Coen; Kerbosch, Joep 📂 Article 📅 1973 🏛 Association for Computing Machinery 🌐 English ⚖ 442 KB

Algorithm 457: finding all cliques of an

Algorithm 457: finding all cliques of an undirected graph

✍ Bron, Coen; Kerbosch, Joep 📂 Article 📅 1973 🏛 Association for Computing Machinery 🌐 English ⚖ 442 KB

## Description bttroductian. A maximal complete subgraph (clique) is a complete subgraph that is not contained in any other complete subgraph. A recent paper [1] describes a number of techniques to find maximal complete subgraphs of a given undirected graph. In this paper, we present two backtrack