Andreas Parra, Petra Scheffler  Home/Search
Context Related
Links: ACM DBLP | 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 HelpProblem Downloading? From: 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)
Context of citations to this paper: More
.... separator causes a number of other minimal separators to disappear from the graph; this process was rst introduced by [17] is studied in [22] and its mechanism is described and used in [6] In this Section, we will examine what happens to the lattice when a minimal separator...
Cited by: More
Two Tricks to Triangulate Chordal Probe Graphs in.. - Berry, Golumbic, Lipshteyn (2004) (Correct)
Recognizing and Triangulating Chordal Probe Graphs - Berry, Golumbic, Lipshteyn (2003) (Correct)
Representing a Concept Lattice By a Graph - Berry, Sigayret (2004) (Correct)
Similar documents (at the sentence level):
13.9%: Structural and Algorithmic Aspects of Chordal Graph Embeddings - Asensio (1996) (Correct)
Active bibliography (related documents): More All
4.0: A Concept for the Representation of Data and Algorithms - Möller, Müller (1992) (Correct)
1.2: Realization Spaces of 4-Polytopes Are Universal - Richter-Gebert, Ziegler (1995) (Correct)
0.6: Treewidth and Minimum Fill-in on D-Trapezoid Graphs - Bodlaender, Kloks, al. (1995) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
1.4: Computing the Treewidth and the Minimum Fill-in With the.. - Bodlaender, Rotics (2001) (Correct)
0.6: Treewidth Equals Bandwidth for AT-Free Claw-Free Graphs - Parra, Scheffler (1995) (Correct)
0.5: Minimal Triangulations for Graphs with "Few" Minimal Separators - Bouchitte, Todinca (1998) (Correct)
Related documents from co-citation: More All
16: Algorithmic Graph Theory and Perfect Graphs (context) - Golumbic - 1980
12: Decomposition by clique separators (context) - Tarjan - 1985
10: Treewidth and pathwidth of permutation graphs - Bodlaender, Kloks et al. - 1995
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 ACM DBLP
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 ACM DBLP
97 A tourist guide through treewidth - Bodlaender - 1993 DBLP
90 On rigid circuit graphs (context) - Dirac - 1961
65 The pathwidth and treewidth of cographs - Bodlaender, Mohring - 1993 ACM DBLP
62 The transitive reduction of a directed graph (context) - Aho, Garey et al. - 1972 DBLP
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 ACM DBLP
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 ACM DBLP
24 Treewidth of circle graphs (context) - Kloks - 1993 DBLP
18 Bipartite permutation graphs (context) - Spinrad, Brandstadt et al. - 1987 ACM
14 Treewidth and pathwidth of cocomparability graphs of bounded.. (context) - Kloks, Kratsch et al. - 1993
12 Computing treewidth and minimum fill-in: All you need are th.. (context) - Kloks, Bodlaender et al. DBLP
11 applications and algorithms (context) - Corneil, Perl et al. - 1984
10 Karsten Weihe: Using Network Flows for Surface Modeling (context) - Mohring, Muller-Hannemann - 1994
9 Trapezoid graphs and their coloring (context) - Dagan, Golumbic et al. - 1988 ACM
9 Triangulating multitolerance graphs (context) - Parra - 1994 ACM DBLP
8 Erratum to the ESA'93 Proceedings (context) - Kloks, Bodlaender et al. - 1994
8 Finding all minimal separators of a graph (context) - Kloks, Kratsch - 1994 ACM DBLP
6 Interval dimension is a comparability invariant (context) - Habib, Kelly et al. - 1991 ACM
6 Computations and Approximations (context) - Kloks - 1994
6 Triangulating graphs without asteroidal triples (context) - Mohring ACM DBLP
4 Modular decomposition techniques for distance-hereditary gra.. (context) - Rajaraman, Balakrishnan et al. - 1994
4 Schulz: The Interval Order Polytope of a Digraph (context) - Muller - 1994
4 Special Issue on Disjoint Paths (context) - Wagner, for et al. - 1993
3 Schulz: Facets of the Generalized Permutahedron of a Poset (context) - von Arnim - 1994
3 Lorenz Wernisch: Optimal Algorithms for Trapezoid Graphs (context) - Felsner, Muller - 1993
2 Jean-Xavier Rampon: Constructing Colorings for Diagrams (context) - Felsner, Gustedt et al. - 1991
2 Karsten Weihe: Wiring Knock-Knee Layouts: A Global Approach (context) - Sarrafzadeh, Wagner et al. - 1992
2 Dorothea Wagner: Two-Layer Wiring with Pin Preassignments (context) - Molitor, Sparmann - 1993
2 Frank Wagner: VLSI Network Design (context) - Mohring, Wagner - 1992
2 Mohring: On the Interplay between Interval Dimension and Dim.. (context) - Felsner, Habib - 1991
2 Gerhard Woeginger: The Disjoint Cliques Problem (context) - Jansen, Scheffler - 1992
2 Mohring: Comparability Invariance of Geometric Notions of Or.. (context) - Habib, Kelly - 1992
1 Matrix mulitiplication via arithmetic progressions (context) - Coppersmith, Winograd - 1987
1 and related problems. Proc. 2nd SODA (context) - for, -chain - 1991
1 Optimal algorithms for trapezoid graphs (context) - Felsner, Muller et al. - 1993
1 Fachbereich Mathematik (context) - Flotow, of et al. - 1993
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