A general method for generating all maximal independent sets of a graph

MaRDI QIDQ3641025zbMATH OpenFDO

Authors Jianhong Yin, Ronggui Wang, Feng Xue

Publication date 11 November 2009

zbMATH Keywords

Hasse diagrammaximal independent setNP-problemquasi order set

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• On generating all maximal independent sets
• scientific article; zbMATH DE number 6180530
• scientific article; zbMATH DE number 20270
• Generate all maximal independent sets in permutation graphs
• An efficient algorithm to generate all maximal independent sets on trapezoid graphs

Cited in

(1)

• On generating all maximal independent sets

This page was built for publication: A general method for generating all maximal independent sets of a graph

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