An algorithm for generating all maximal independent subsets of posets

This publication has 11 references indexed in Scilit:

• Clique detection for nondirected graphs: Two new algorithms
  Computing, 1979
• Graph Theory
  Published by Springer Nature ,1979
• The complexity of comparability graph recognition and coloring
  Computing, 1977
• Comparability graphs and a new matroid
  Journal of Combinatorial Theory, Series B, 1977
• Cliques in random graphs
  Mathematical Proceedings of the Cambridge Philosophical Society, 1976
• Algorithm 457: finding all cliques of an undirected graph
  Communications of the ACM, 1973
• Permutation Graphs and Transitive Graphs
  Journal of the ACM, 1972
• A Dual of Dilworth's Decomposition Theorem
  The American Mathematical Monthly, 1971
• A Characterization of Comparability Graphs and of Interval Graphs
  Canadian Journal of Mathematics, 1964
• Some combinatorial problems on partially ordered sets
  Proceedings of Symposia in Applied Mathematics, 1960