Magnitude ordering of degree complements of certain node pairs in an undirected graph and an algorithm to find a class of maximal subgraphs
- 30 September 1979
- journal article
- Published by Elsevier in Computers and Electrical Engineering
- Vol. 6 (3) , 139-151
- https://doi.org/10.1016/0045-7906(79)90002-8
Abstract
No abstract availableKeywords
Funding Information
- National Science Council
This publication has 12 references indexed in Scilit:
- Sequential Algorithm for the Determination of Maximum CompatiblesIEEE Transactions on Computers, 1974
- Algorithm 457: finding all cliques of an undirected graphCommunications of the ACM, 1973
- Corrections to Bierstone's Algorithm for Generating CliquesJournal of the ACM, 1972
- An Analysis of Some Graph Theoretical Cluster TechniquesJournal of the ACM, 1970
- On finding maximum compatiblesProceedings of the IEEE, 1969
- Scheduling of traffic lights—A new approachTransportation Research, 1968
- Analysis of Graphs by Connectivity ConsiderationsJournal of the ACM, 1966
- On cliques in graphsIsrael Journal of Mathematics, 1965
- Boolean Algebra, Map Coloring, and InterconnectionsThe American Mathematical Monthly, 1962
- Minimizing the Number of States in Incompletely Specified Sequential Switching FunctionsIEEE Transactions on Electronic Computers, 1959