𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algorithm 457: finding all cliques of an undirected graph

✍ Scribed by Bron, Coen; Kerbosch, Joep

Book ID
111919795
Publisher
Association for Computing Machinery
Year
1973
Tongue
English
Weight
442 KB
Volume
16
Category
Article
ISSN
0001-0782

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Efficient algorithms for finding maximum
Efficient algorithms for finding maximum cliques of an overlap graph
✍ Sumio Masuda; Kazuo Nakajima; Toshinobu Kashiwabara; Toshio Fujisawa πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 728 KB

Let F = { I , , 12,. . . , Z,,} be a finite family of closed intervals on the real line. Two intervals 4 and Ik in F are said to overlap each other if they intersect but neither one of them contains the other. A graph G = (V, E) is called an overlap graph for F if there is a one-to-one correspondenc