Listing all Minimal Separators of a Graph
From MaRDI portal
Publication:4388888
DOI10.1137/S009753979427087XzbMath0907.68136MaRDI QIDQ4388888
Publication date: 10 May 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (31)
Minimal triangulations of graphs: a survey ⋮ A linear time algorithm to list the minimal separators of chordal graphs ⋮ Listing all the minimal separators of a 3-connected planar graph ⋮ Vertex ranking of asteroidal triple-free graphs ⋮ Representing a concept lattice by a graph ⋮ Approximately counting locally-optimal structures ⋮ Approximately Counting Locally-Optimal Structures ⋮ A local approach to concept generation ⋮ Treewidth computation and extremal combinatorics ⋮ Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph ⋮ The \(k\)-hop connected dominating set problem: approximation and hardness ⋮ Some results on connected vertex separators ⋮ A new characterization of unichord-free graphs ⋮ Depletable channels: dynamics, behaviour, and efficiency in network design ⋮ On the hardness of inclusion-wise minimal separators enumeration ⋮ Listing all spanning trees in Halin graphs — sequential and Parallel view ⋮ Ordered coloring of grids and related graphs ⋮ On treewidth approximations. ⋮ Chordal Coxeter groups. ⋮ Minimal separators in extended \(P_4\)-laden graphs ⋮ Separator orders in interval, cocomparability, and AT-free graphs ⋮ On probe permutation graphs ⋮ Solution methods for the vertex variant of the network system vulnerability analysis problem ⋮ Conditions for swappability of records in a microdata set when some marginals are fixed ⋮ Unnamed Item ⋮ Linear separation of connected dominating sets in graphs ⋮ On the Number of Minimal Separators in Graphs ⋮ Minimal separators in <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>P</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:math>-tidy graphs ⋮ GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH ⋮ Observability-blocking control using sparser and regional feedback for network synchronization processes ⋮ Listing all potential maximal cliques of a graph
This page was built for publication: Listing all Minimal Separators of a Graph
