• DocumentCode
    1113505
  • Title

    Sequential Algorithm for the Determination of Maximum Compatibles

  • Author

    Stoffers, Karl E.

  • Author_Institution
    Department of Electrical Engineering, Californiania State University
  • Issue
    1
  • fYear
    1974
  • Firstpage
    95
  • Lastpage
    98
  • 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
    Compatibility matrix, Hasse diagram, lexicographic ordering, maximal complete subgraphs, spanning tree, symmetric graph.; Automata; Equations; Helium; Inspection; Logic; Manuals; Symmetric matrices; Tree graphs; Vectors; Compatibility matrix, Hasse diagram, lexicographic ordering, maximal complete subgraphs, spanning tree, symmetric graph.;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/T-C.1974.223786
  • Filename
    1672379
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1113505