John Fouhy  Home/Search
Context Related
| mcs.vuw.ac.nz/~downey/fthes.ps 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: mcs.vuw.ac.nz/~downey/students (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Many real-life problems can be modelled using graphs. However, the so- lutions to these problems are often N P-complete. In 1986, Robertson and Seymour introduced the notion of a tree-decomposition of a graph, with an associated width called the treewidth, as a formal characterisation of how "tree-like" a graph is. Subsequently, Arnborg and Proskurowski de- veloped techniques for using tree-decompositions to construct dynamic programming algorithms for solving problems such as DOMINATING SET,... (Update)
Context of citations to this paper: More
...Algorithms. There have also been a number of implementations and attempts at implementations of this material including [KBFvH03, McC03, Fo03, St00, AGN01]. Later in this section we will address the implementability of the general methods mentioned in earlier sections. We...
Cited by: More
Parameterized Complexity for the Skeptic - Downey (2003) (Correct)
Active bibliography (related documents): More All
0.6: A Wide-Range Algorithm for Minimal Triangulation.. - Berry, Bordat.. (2003) (Correct)
0.5: Fast Generation of All Perfect Elimination Orderings .. - Chandran, Ibarra.. (2002) (Correct)
0.5: Probabilistic Reasoning for Fault Management on XUNET - Huard (1994) (Correct)
Similar documents based on text: More All
0.3: Contributions to Parameterized Complexity - Mccartin (2003) (Correct)
0.2: Generally Applicable Heuristics for Global Optimisation: An.. - Telfar (1994) (Correct)
0.2: Online Problems, Pathwidth, and Persistence - Downey, McCartin (Correct)
Related documents from co-citation: More All
4: Fixed-parameter tractability and Completeness I: Basic Results - Downey, Fellows - 1995
2: A linear time algorithm for finding tree-decompositions of small treewidth - Bodlaender - 1996
BibTeX entry: (Update)
J. Fouhy, "Computational Experiments on Graph Width Metrics," MSc Thesis, Victoria University, Wellington, 2003. http://citeseer.ist.psu.edu/fouhy03computational.html More
@misc{ fouhy03computational,
author = "J. Fouhy",
title = "Computational Experiments on Graph Width Metrics",
text = "J. Fouhy, Computational Experiments on Graph Width Metrics, MSc Thesis,
Victoria University, Wellington, 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/fouhy03computational.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-co.. (context) - GAREY, JOHNSON - 1979
280 Online Computation and Competitive Analysis (context) - BORODIN, EL-YANIV - 1998
202 A linear time algorithm for finding treedecompositions of sm.. - BODLAENDER - 1996
178 Algorithmic aspects of vertex elimination on graphs (context) - ROSE, TARJAN et al. - 1976
127 arboretum of graphs with bounded treewidth (context) - BODLAENDER - 1998
119 Simple linear-time algorithms to test chordality of graphs (context) - TARJAN, YANNAKAKIS - 1984
109 Efficient algorithms for combinatorial problems on graphs wi.. (context) - ARNBORG - 1985
104 Springer-Verlag (context) - DIESTEL - 2000
97 Incidence matrices and interval graphs (context) - FULKERSON, GROSS - 1965
95 Vertex cover: Further observations and further improvements - CHEN, KANJ et al. - 2001
82 Treewidth: Algorithmic techniques and results - BODLAENDER - 1998
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, BOLAND - 1962
53 The intersection graphs of subtrees of trees are exactly the.. (context) - GAVRIL - 1974
47 Zur allgemeinen kurventheorie (context) - MENGER - 1927
46 Preserving order in a forest in less than logarithmic time (context) - BOAS - 1975
45 Upper bounds for vertex cover further improved - NIEDERMEIER, ROSSMANITH - 1999
41 Diameter and treewidth in minor-closed graph families (context) - EPPSTEIN - 2000
41 Graph minors ii: Algorithmic aspects of tree-width (context) - ROBERTSON, SEYMOUR - 1986
39 Lecture Notes in Computer Science (context) - KLOKS - 1994
35 Monographs in Computer Science (context) - DOWNEY, FELLOWS - 1997
35 Coloring inductive graphs on-line (context) - IRANI - 1994
29 Efficient and constructive algorithms for the pathwidth and .. - BODLAENDER, KLOKS - 1996
27 Fundamentals of Algorithmics (context) - BRASSARD, BRATLEY - 1996
25 and shortest elimination tree (context) - BODLAENDER, GILBERT et al. - 1995
24 Optimal junction trees - JENSEN, JENSEN - 1994
24 A simple min-cut algorithm (context) - WAGNER, STOER - 1997
22 Goldberg's algorithm for the maximum flow in perspective: a .. (context) - ANDERSON, SETUBAL - 1993
19 Junction trees and decomposable hypergraphs (context) - JENSEN - 1988
18 Recognizing weakly triangulated graphs by edge separability - BERRY, BORDAT et al. - 2000
15 Parameterized complexity for the skeptic - DOWNEY - 2003
15 Branch Decompositions and their Applications (context) - HICKS - 2000
14 Treewidth: Computational experiments - KOSTER, BODLAENDER et al. - 2001
12 Frequency Assignment --- Models and Algorithms - KOSTER - 1999
11 Maximum cardinality search for computing minimal triangulati.. (context) - BERRY, BLAIR et al. - 2002
10 Invitation to fixed-parameter algorithms - NIEDERMEIER - 2002
8 Parameterized complexity for the database theorist (context) - GROHE - 2002
8 Competitive online algorithms - ALBERS - 1996
7 Triangulated and weakly triangulated graphs: Simpliciality i.. - BERRY, BORDAT - 2000
6 the tree representation of chordal graphs (context) - SHIBATA - 1988
5 Algorithms for Graphs of Small Treewidth (context) - DE FLUITER - 1997
2 Chordal graphs: Their testing and their role - HUARD - 1994
2 Efficient implementation of a minimal triangulation algorith.. (context) - HEGGERNES, VILLANGER - 2002
2 Recent developments in maximum flow algorithms - GOLDBERG - 1998
2 A note on lexicographic breadth first search for chordal gra.. - SIMON - 1995
1 excluded minors and approximation algorithms (context) - GROHE - 2001
1 University of Waterloo (context) - HAJIAHAYI - 2001
1 On characterising graphs with branchwidth at most four (context) - RIGGINS - 2001
1 Online algorithms: A study of graph-theoretic concepts - ALBERS
1 Discrete Mathematics and Theroetical Computer Science (context) - BODLAENDER - 1999
1 To appear in Mathematical Programming (context) - ALBERS, algorithms - 2003
1 Utrecht university (context) - BODLAENDER, ENGELFRIET - 1994
http://www.upb.de/cs/agmadh
Documents on the same site (http://www.mcs.vuw.ac.nz/~downey/students.html):
Contributions to Parameterized Complexity - Mccartin (2003) (Correct)
Structural Properties of D.C.E. Degrees and Presentations of C.E.. - Wu (2002) (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