On a New Approach for Finding All the Modified Cut-Sets in an Incompatibility Graph

DOI10.1109/T-C.1973.223683zbMath0253.05135OpenAlexW1971806064MaRDI QIDQ5666589

No author found.

Publication date: 1973

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/t-c.1973.223683

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items

An appraisal of the performance of the MMSC subgraph generation algorithm on a Cyber system 170/720, Complexity and performance of a graph theory algorithm for cluster analysis†, Cliques of a graph-variations on the Bron-Kerbosch algorithm, Strong connectivity in symmetric graphs and generation of maximal minimally strongly connected subgraphs