scientific article; zbMATH DE number 434864

MaRDI QIDQ3139713zbMATH OpenFDO

Authors

Publication date 11 November 1993

zbMATH Keywords

cocomparability graphsindependent setspermutation graphsstring matchingperfect graphscomparability graphsmaximal cliques

Mathematics Subject Classification ID

Applications of graph theory (05C90) Directed graphs (digraphs), tournaments (05C20) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Generate all maximal independent sets in permutation graphs
• Algorithm Theory - SWAT 2004
• Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs
• Counting independent sets in cocomparability graphs
• Generation of maximum independent sets of a bipartite graph and maximum cliques of a circular-arc graph

Cited in

(2)

• Generate all maximal independent sets in permutation graphs
• Enumeration aspects of maximal cliques and bicliques

This page was built for publication:

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