An algorithm for generating all maximal independent subsets of posets

DOI10.1007/BF02237953zbMath0449.68029OpenAlexW366472614MaRDI QIDQ1147517

M. Bartusch

Publication date: 1981

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02237953

zbMATH Keywords

algorithmcomparability graphbipartite graphscliquesrooted treemaximal independent subsets of posets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Partial orders, general (06A06) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

On the generation of circuits and minimal forbidden sets

Uses Software

• Algorithm 457

Cites Work

• Clique detection for nondirected graphs: Two new algorithms
• Comparability graphs and a new matroid
• The complexity of comparability graph recognition and coloring
• Principles of combinatorics
• Cliques in random graphs
• A New Algorithm for Generating All the Maximal Independent Sets
• An Algorithm for Project (Job) Sequencing with Resource Constraints
• Permutation Graphs and Transitive Graphs
• Algorithm 457: finding all cliques of an undirected graph
• A Dual of Dilworth's Decomposition Theorem
• A Characterization of Comparability Graphs and of Interval Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An algorithm for generating all maximal independent subsets of posets