scientific article; zbMATH DE number 1500539

zbMATH Open0962.68132MaRDI QIDQ4501558FDOQ4501558

Authors: Vincent Bouchitté, Ioan Todinca 

Publication date: 4 September 2000

Title of this publication is not available (Why is that?)

Recommendations

• Listing all potential maximal cliques of a graph
• Listing all maximal cliques in large sparse real-world graphs
• Listing all maximal cliques in sparse graphs in near-optimal time
• Finding a Maximum Clique in an Arbitrary Graph
• Enumerating maximal cliques in large sparse graphs
• scientific article; zbMATH DE number 19214
• Finding maximum cliques in arbitrary and in special graphs
• Maximizing the number of cliques in graphs with given matching number
• Finding all maximal cliques in dynamic graphs

zbMATH Keywords

tree-widthpotential maximal clique of a graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cited In (6)

• Approximating the treewidth of AT-free graphs.
• The complete list of maximal cliques of Quad\((n,q)\), \(q\) odd
• Listing Maximal Subgraphs Satisfying Strongly Accessible Properties
• Listing all potential maximal cliques of a graph
• Tree decompositions with small cost
• Treewidth and minimum fill-in: Grouping the minimal separators

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 Q4501558)