✦ LIBER ✦

Clique detection in directed graphs: a new algorithm

✍ Scribed by W. Meeusen; L. Cuyvers

Publisher: Elsevier Science
Year: 1975
Tongue: English
Weight: 997 KB
Volume: 1
Category: Article
ISSN: 0377-0427
DOI: 10.1016/0771-050x(75)90035-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A clique-detection algorithm based on ne

A clique-detection algorithm based on neighborhoods in graphs

✍ Robert E. Osteen; Julius T. Tou 📂 Article 📅 1973 🏛 Springer 🌐 English ⚖ 656 KB

On Clique Growth in Products of Directed

On Clique Growth in Products of Directed Graphs

✍ Stephan Brandt; Gunnar Brinkmann; Thomas Harmuth 📂 Article 📅 1998 🏛 Springer Japan 🌐 English ⚖ 82 KB

A polynomial algorithm for constructing

A polynomial algorithm for constructing the clique graph of a line graph

✍ Bruce Hedman 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 250 KB

A parallel search algorithm for directed

A parallel search algorithm for directed acyclic graphs

✍ Ratan K. Ghosh; G. P. Bhattacharjee 📂 Article 📅 1984 🏛 Springer Netherlands 🌐 English ⚖ 860 KB

An algorithm for source location in dire

An algorithm for source location in directed graphs

✍ Mihály Bárász; Johanna Becker; András Frank 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 207 KB

Kernels in graphs with a clique-cutset

✍ Henry Jacob 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 138 KB

We consider graphs that have a clique-cutset, and we show that this property preserves the existence of a kernel in a certain sense. We consider finite directed graphs that do not have multiple arcs or loops, but there may be symmetric arcs between some pairs of vertices. Let G = (V, A) be a direct