H. Bodlaender, T. Kloks, D. Kratsch  Home/Search
Context Related
| archive.cs.uu.nl/pub/RUU/...199230.pdf Cached: PS.gz PS 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.
Image Update HelpPS.gz PS PDF From: cs.uu.nl/resear...EAR=&AUTH=&GRP= (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper we discuss the problem of finding tree- and path-decompositions for permutation graphs. We also show that for these graphs, the treewidth and the pathwidth are the same (Update)
Context of citations to this paper: More
.... graphs [ACP87] On the other hand, treewidth can be computed exactly in polynomial time for chordal graphs, permutation graphs [BKK95], circular arc graphs [SSR94] circle graphs [Klo96] distance hereditary graphs [BDK00] and for graphs of a xed treewidth [Bod96]...
Cited by: More
Automating Resource Management for Distributed Business Processes - Ginis (2002) (Correct)
Approximation Algorithms for Classes of Graphs.. - Demaine.. (Correct)
1.5-Approximation for Treewidth of Graphs Excluding a.. - Demaine, Hajiaghayi.. (2002) (Correct)
Active bibliography (related documents): More All
0.7: The Complexity of Subgraph Isomorphism: Duality Results for.. - Gupta, Nishimura (1995) (Correct)
0.5: On the Treewidth and Pathwidth of Permutation Graphs - Kloks, al. (1992) (Correct)
0.4: Domination and Total Domination on Asteroidal Triple-Free Graphs - Kratsch (1996) (Correct)
Similar documents based on text: More All
1.3: Treewidth and Minimum Fill-in on D-Trapezoid Graphs - Bodlaender, Kloks, Kratsch.. (1996) (Correct)
1.3: Efficient and Constructive Algorithms for the Pathwidth and.. - Bodlaender, Kloks (1993) (Correct)
1.1: A Tourist Guide through Treewidth - Bodlaender (1993) (Correct)
Related documents from co-citation: More All
26: The pathwidth and treewidth of cographs - Bodlaender, ohring - 1993
23: Complexity of finding embeddings in a k-tree (context) - Arnborg, Corneil et al. - 1987
22: Treewidth of circle graphs (context) - Kloks - 1996
BibTeX entry: (Update)
H. Bodlaender, T. Kloks and D. Kratsch, Treewidth and pathwidth of permutation graphs, SIAM Journal on Discrete Mathematics 8, 606 616, 1995. http://citeseer.ist.psu.edu/bodlaender92treewidth.html More
@inproceedings{ bodlaender93treewidth,
author = "Hans L. Bodlaender and Ton Kloks and Dieter Kratsch",
title = "Treewidth and Pathwidth of Permutation Graphs",
booktitle = "Automata, Languages and Programming",
pages = "114-125",
year = "1993",
url = "citeseer.ist.psu.edu/bodlaender92treewidth.html" }
Citations (may not include all citations):145 Easy problems for tree-decomposable graphs - Arnborg, Lagergren et al. - 1991
109 Efficient algorithms for combinatorial problems on graphs wi.. (context) - Arnborg - 1985
65 The pathwidth and treewidth of cographs - Bodlaender, MShring - 1990
61 Linear time algorithms for NP-hard problems restricted to pa.. (context) - Arnborg, Proskurowski - 1989
59 Representation of a finite graph by a set of intervals on th.. (context) - Lekkerkerker, Ch - 1962
41 Finding approximate separators and computing treewidth quick.. (context) - Reed - 1992
37 Graph algorithms - van Leeuwen - 1990
24 Finding minimal forbidden minors using a fi- nite congruence (context) - Lagergren, Arnborg - 1991
19 Treewidth of chordal bipartite graphs - Kloks, Kratsch - 1992
17 Better algorithms for the pathwidth and treewidth of graphs (context) - Bodlaender, Kloks - 1991
14 a graph partition problem with application to VLSI layout (context) - Sen, Deng et al. - 1992
13 Permutation graphs and transitive graphs (context) - Even, Pnueli et al. - 1972
12 Achromatic number is NP-complete for cographs and interval g.. (context) - Bodlaender - 1989
11 Schriftenreihe des Fachbere- ichs Mathematik (context) - Brandstdt, classes et al. - 1991
11 Topics on Perfect Graphs (context) - Berge, Chvatal - 1984
7 Comparability graphs and intersec- tion graphs (context) - Golumbic, Rotem et al. - 1983
5 On cocolourings and cochromatic num- bers of graphs (context) - Gimbel, Kratsch et al.
3 Complexity of finding embed- clings in a k-tree (context) - Arnborg, Corneil et al. - 1987
3 the restriction of some NP-complete graph problems to permut.. (context) - Brandstdt, Kratsch - 1985
3 Domination in permutation graphs (context) - Farbet, Keil - 1985
3 Pathwidth for Chordal graphs is NP-complete (context) - Gustedt
3 Approximating treewidth and pathwidth of some classes of per.. (context) - Kloks, Bodlaender
2 A tourist guide through treewidth, Technical report RUU-CS-9.. (context) - Bodlaender - 1992
1 DynarniC prograrnming algorithms on graphs with bounded tree.. (context) - Bodlaender - 1988
1 On comparability and permutation graphs (context) - Spintad - 1985
1 Algorithmic Graph Theory and Perfect Graphs (context) - Golurnbic - 1980
1 eewidth of circular arc graphs (context) - Sundaram, Singh et al. - 1991
1 On domination problems for permutation and other perfect gra.. (context) - Brandstilt, Kratsch - 1987
1 Monotonic coverings of finite sets (context) - Wagner - 1984
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.uu.nl/research/techreps/techreps.php?submit=show+reports&YEAR=&AUTH=&GRP=): More
On the Two-Level Uncapacitated Facility Location Problem - Aardal, Labbé (1995) (Correct)
A Tourist Guide through Treewidth - Bodlaender (1993) (Correct)
Predictive Probabilistic Models for Treatment Planning in.. - Peek (1998) (Correct)
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