Title :
On finding maximum compatibles
Author :
Nieminen, Juhani
Author_Institution :
Finnish Academy, Lauttasaarentie, Helsinki, Finland
fDate :
4/1/1975 12:00:00 AM
Abstract :
A description of a way of finding the maximum compatibles (maximal complete subgraphs of an undirected graph) is presented. Only a few operations are needed and at each step the graph under consideration is reduced.
Keywords :
Application software; Computer science; Graph theory; Terminology;
Journal_Title :
Proceedings of the IEEE
DOI :
10.1109/PROC.1975.9817
