A Linear Time Algorithm for Enumerating All the Minimum and Minimal Separators of a Chordal Graph

Authors:
L. Sunil Chandran
Affiliations:
-
Venue:
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Year:
2001

Citing 11
Cited 1

Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs

SIAM Journal on Computing
Efficient parallel algorithms for testing k-connectivity and finding disjoint s-t paths in graphs

SIAM Journal on Computing
Efficient algorithms for listing combinatorial structures

Efficient algorithms for listing combinatorial structures
Treewidth of chordal bipartite graphs

Journal of Algorithms
Treewidth and Pathwidth of Permutation Graphs

SIAM Journal on Discrete Mathematics
Efficient enumeration of all minimal separators in a graph

Theoretical Computer Science
A static 2-approximation algorithm for vertex connectivity and incremental approximation algorithms for edge and vertex connectivity

Journal of Algorithms
Listing all Minimal Separators of a Graph

SIAM Journal on Computing
Using expander graphs to find vertex connectivity

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Computing vertex connectivity: new bounds from old techniques

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Linear-time counting algorithms for independent sets in chordal graphs

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give O(m+ n) algorithms for enumerating all minimum separators as well as minimal separators in a connected chordal graph. We give a tight upper bound, n - ϰ(G) - 1, for the number of minimal separators in a chordal graph. An important contribution of the paper is our characterisation of minimal (minimum) separators of chordal graphs and the above results are obtained as consequences of the characterisations.