Sequential Algorithm for the Determination of Maximum Compatibles
- 1 January 1974
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-23 (1) , 95-98
- https://doi.org/10.1109/t-c.1974.223786
Abstract
This correspondence describes an algorithm which finds the maximum compatibles (maximal complete subgraphs of a symmetric graph) sequentially and in lexicographic order. The algorithm is intended for use in digital computers, where it requires only a small program and very little memory space.Keywords
This publication has 2 references indexed in Scilit:
- On a New Approach for Finding All the Modified Cut-Sets in an Incompatibility GraphIEEE Transactions on Computers, 1973
- Scheduling of traffic lights—A new approachTransportation Research, 1968