Sequential Algorithm for the Determination of Maximum Compatibles

DOI10.1109/T-C.1974.223786MaRDI QIDQ4401983zbMATH OpenOpenAlexFDO

Authors Karl E. Stoffers

Publication date 1974

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

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

Mathematics Subject Classification ID

Graph theory (05C99) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Cited in

(3)

• Minimal coverings for incompletely specified sequential machines
• Complexity and performance of a graph theory algorithm for cluster analysis†
• Strong connectivity in symmetric graphs and generation of maximal minimally strongly connected subgraphs

This page was built for publication: Sequential Algorithm for the Determination of Maximum Compatibles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4401983)