Efficient enumeration of all minimal separators in a graph

DOI10.1016/S0304-3975(97)83809-1zbMath0901.68145OpenAlexW2074211284MaRDI QIDQ1390866

Weifa Liang, Hong Shen

Publication date: 22 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(97)83809-1

zbMATH Keywords

minimal separators

Mathematics Subject Classification ID

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

Related Items (16)

A linear time algorithm to list the minimal separators of chordal graphs ⋮ Listing all the minimal separators of a 3-connected planar graph ⋮ Disconnected matchings ⋮ Representing a concept lattice by a graph ⋮ Approximately counting locally-optimal structures ⋮ Approximately Counting Locally-Optimal Structures ⋮ A local approach to concept generation ⋮ Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph ⋮ Depletable channels: dynamics, behaviour, and efficiency in network design ⋮ AMP Chain Graphs: Minimal Separators and Structure Learning Algorithms ⋮ Listing Maximal Subgraphs Satisfying Strongly Accessible Properties ⋮ Unnamed Item ⋮ Linear separation of connected dominating sets in graphs ⋮ On the Number of Minimal Separators in Graphs ⋮ Disconnected matchings ⋮ GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
• Computing connected components on parallel computers
• An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset
• Efficient Algorithms for Listing Combinatorial Structures

This page was built for publication: Efficient enumeration of all minimal separators in a graph