Finding all minimal separators of a graph

DOI10.1007/3-540-57785-8_188MaRDI QIDQ4942656zbMATH OpenFDO

Authors Ton Kloks, Dieter Kratsch

Publication date 16 March 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-57785-8_188

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Cited in

(9)

• Characterizations and algorithmic applications of chordal graph embeddings
• Efficient enumeration of all minimal separators in a graph
• On treewidth and minimum fill-in of asteroidal triple-free graphs
• Solution methods for the vertex variant of the network system vulnerability analysis problem
• How to use the minimal separators of a graph for its chordal triangulation
• Vertex ranking of asteroidal triple-free graphs
• A safeness condition for minimal separators based on vertex connectivity
• Enumerating minimal dominating sets and variants in chordal bipartite graphs
• Listing all the minimal separators of a 3-connected planar graph

This page was built for publication: Finding all minimal separators of a graph

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