scientific article; zbMATH DE number 1420907

MaRDI QIDQ4944976zbMATH OpenFDO

Authors Anne Berry, Jean-Paul Bordat, Olivier Cogis

Publication date 7 June 2000

zbMATH Keywords

minimal separatorsenumeration algorithm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
• Efficient enumeration of all minimal separators in a graph
• scientific article; zbMATH DE number 1796975
• A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph
• scientific article; zbMATH DE number 1500572

Cited in

(14)

• The k-hop connected dominating set problem: approximation and hardness
• A linear time algorithm to list the minimal separators of chordal graphs
• Approximation of knapsack problems with conflict and forcing graphs
• scientific article; zbMATH DE number 7559396 (Why is no real title available?)
• GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
• Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph
• scientific article; zbMATH DE number 7378700 (Why is no real title available?)
• Solving graph problems via potential maximal cliques: an experimental evaluation of the Bouchitté-Todinca algorithm
• On the tractability of optimization problems on \(H\)-graphs
• scientific article; zbMATH DE number 7764120 (Why is no real title available?)
• Efficient enumeration of all minimal separators in a graph
• Graphs with polynomially many minimal separators
• Efficiently enumerating minimal triangulations
• scientific article; zbMATH DE number 1420906 (Why is no real title available?)

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