Listing all Minimal Separators of a Graph

Authors:
T. Kloks;D. Kratsch
Affiliations:
-;-
Venue:
SIAM Journal on Computing
Year:
1998

Citing 0
Cited 19

Listing all potential maximal cliques of a graph

Theoretical Computer Science
Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition

SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Listing All Potential Maximal Cliques of a Graph

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
A Linear Time Algorithm for Enumerating All the Minimum and Minimal Separators of a Chordal Graph

COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Generating All the Minimal Separators of a Graph

WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Efficient Analysis of Graphs with Small Minimal Separators

WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
On treewidth approximations

Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Discovering patterns of medical practice in large administrative health databases

Data & Knowledge Engineering
Representing a concept lattice by a graph

Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
A local approach to concept generation

Annals of Mathematics and Artificial Intelligence
On probe permutation graphs

Discrete Applied Mathematics
Exponential time algorithms for the minimum dominating set problem on some graph classes

ACM Transactions on Algorithms (TALG)
Representing a concept lattice by a graph

Discrete Applied Mathematics
Treewidth: structure and algorithms

SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph

Discrete Applied Mathematics
Separator orders in interval, cocomparability, and AT-free graphs

Discrete Applied Mathematics
On probe permutation graphs

TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Ordered coloring of grids and related graphs

Theoretical Computer Science
Minimal separators in extended P4-laden graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

An efficient algorithm listing all minimal vertex separators of an undirected graph is given. The algorithm needs polynomial time per separator that is found.