Recognizing weakly triangulated graphs by edge separability

Authors:
Anne Berry;Jean-Paul Bordat;Pinar Heggernes
Affiliations:
LIMOS, Université Blaise Pascal, Ufr Sciences F-63173 Aubière, France;LIRMM, 161 Rue Ada F-34392 Montpellier, France;Department of Informatics, University of Bergen N-5020 Bergen, Norway
Venue:
Nordic Journal of Computing
Year:
2000

Citing 9
Cited 12

An efficient algorithm for finding a two-pair, and its applications

Discrete Applied Mathematics
Finding large holes

Information Processing Letters
Algorithms for weakly triangulated graphs

Discrete Applied Mathematics
Generating weakly triangulated graphs

Journal of Graph Theory
Meyniel weakly triangulated graphs—I: co-perfect orderability

Discrete Applied Mathematics
Meyniel weakly triangulated graphs II: a theorem of Dirac

Discrete Applied Mathematics
A wide-range efficient algorithm for minimal triangulation

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Weakly chordal graph algorithms via handles

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Treewidth and minimum fill-in of weakly triangulated graphs

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

Efficient Implementation of a Minimal Triangulation Algorithm

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Hole and antihole detection in graphs

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Chordal probe graphs

Discrete Applied Mathematics
Computing minimal triangulations in time O(nα log n) = o(n2.376)

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A wide-range algorithm for minimal triangulation from an arbitrary ordering

Journal of Algorithms
Improved algorithms for weakly chordal graphs

ACM Transactions on Algorithms (TALG)
On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem

Theoretical Computer Science
What Is between Chordal and Weakly Chordal Graphs?

Graph-Theoretic Concepts in Computer Science
A wide-range algorithm for minimal triangulation from an arbitrary ordering

Journal of Algorithms
Maximum Weight Independent Sets in hole- and co-chair-free graphs

Information Processing Letters
New applications of clique separator decomposition for the maximum weight stable set problem

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Minimal separators in extended P4-laden graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We apply Lekkerkerker and Boland's recognition algorithm for triangulated graphs to the class of weakly triangulated graphs. This yields a new characterization of weakly triangulated graphs, as well as a new O(m2) recognition algorithm which, unlike the previous ones, is not based on the notion of a 2-pair, but rather on the structural properties of the minimal separators of the graph. It also gives the strongest relationship to the class of triangulated graphs that has been established so far.