An algorithm for generating all maximal independent subsets of posets

DOI10.1007/BF02237953MaRDI QIDQ1147517zbMATH OpenOpenAlexFDO

Authors 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

algorithmbipartite graphscliquesrooted treecomparability graphmaximal independent subsets of posets

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 3156376 (Why is no real title available?)
• scientific article; zbMATH DE number 3617891 (Why is no real title available?)
• scientific article; zbMATH DE number 3637904 (Why is no real title available?)
• A Characterization of Comparability Graphs and of Interval Graphs
• A Dual of Dilworth's Decomposition Theorem
• A New Algorithm for Generating All the Maximal Independent Sets
• Algorithm 457: finding all cliques of an undirected graph
• An Algorithm for Project (Job) Sequencing with Resource Constraints
• Clique detection for nondirected graphs: Two new algorithms
• Cliques in random graphs
• Comparability graphs and a new matroid
• Permutation Graphs and Transitive Graphs
• Principles of combinatorics
• The complexity of comparability graph recognition and coloring

Cited in

(1)

• On the generation of circuits and minimal forbidden sets

Describes a project that uses

Uses Software

• Algorithm 457

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

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