Andreas Parra, Petra Scheffler  Home/Search
Context Related
| math.tuberlin.de/...port4071994.ps.Z Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: math.tuberlin....stract_4071994 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we discuss the relation between the set of all minimal separators of a graph G on the one hand and the set of all possible minimal chordal triangulations of G on the other hand. We prove a 1-1 correspondence between maximal sets of pairwise parallel minimal separators and minimal triangulations. As a consequence, we get polynomial-time algorithms to determine the minimum fill-in and the treewidth in several graph classes. We apply the approach to the class of d-trapezoid graphs... (Update)
Similar documents based on text: More All
1.4: Computing the Treewidth and the Minimum Fill-in With the.. - Bodlaender, Rotics (2001) (Correct)
0.7: Structural and Algorithmic Aspects of Chordal Graph Embeddings - Asensio (1996) (Correct)
0.6: Treewidth Equals Bandwidth for AT-Free Claw-Free Graphs - Parra, Scheffler (1995) (Correct)
BibTeX entry: (Update)
A. Parra and P. Scheer, How to use the minimal separators of a graph for its chordal triangulation, Proceedings of the 22nd International Colloquium on Automata, Languages and Programming, 123 134, Springer-Verlag, Lecture Notes in Computer Science 944, 1995. http://citeseer.ist.psu.edu/parra94how.html More
@inproceedings{ parra95how,
author = "Andreas Parra and Petra Scheffler",
title = "How to Use the Minimal Separators of a Graph for its Chordal Triangulation",
booktitle = "Automata, Languages and Programming",
pages = "123-134",
year = "1995",
url = "citeseer.ist.psu.edu/parra94how.html" }
Citations (may not include all citations):202 A linear time algorithm for finding tree-decompositions of s.. - Bodlaender - 1993
172 Complexity of finding embeddings in a k-tree (context) - Arnborg, Corneil et al. - 1987
145 Easy problems for tree-decomposable graphs - Arnborg, Lagergren et al. - 1991
97 A tourist guide through treewidth - Bodlaender - 1993
90 On rigid circuit graphs (context) - Dirac - 1961
65 The pathwidth and treewidth of cographs - Bodlaender, Mohring - 1993
62 The transitive reduction of a directed graph (context) - Aho, Garey et al. - 1972
41 Graph minors II: Algorithmic aspects of tree-width (context) - Robertson, Seymour - 1986
40 Treewidth and pathwidth of permutation graphs - Bodlaender, Kloks et al. - 1993
36 Algorithmic Graph Theory and Perfect Graphs (context) - Golumbic - 1980
35 Graph problems related to gate matrix layout and PLA folding (context) - Mohring - 1990
28 Algorithmic aspects of comparability graphs and interval gra.. (context) - Mohring
25 Treewidth of circular-arc graphs (context) - Sundaram, Singh et al. - 1994
24 Treewidth of circle graphs (context) - Kloks - 1993
18 Bipartite permutation graphs (context) - Spinrad, Brandstadt et al. - 1987
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC