Results 1  10
of
591
Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
, 1993
"... In this paper we give, for all constants k, l, explicit algorithms, that given a graph G = (V; E) with a treedecomposition of G with treewidth at most l, decide whether the treewidth (or pathwidth) of G is at most k, and if so, find a treedecomposition or (pathdecomposition) of G of width at most ..."
Abstract

Cited by 75 (13 self)
 Add to MetaCart
, there exists a polynomial time algorithm, that, when given a graph G = (V; E) with treewidth k, computes the pathwidth of G and a minimum path decomposition of G.
Treewidth: Characterizations, applications, and computations
, 2006
"... Abstract. This paper gives a short survey on algorithmic aspects of the treewidth of graphs. Some alternative characterizations and some applications of the notion are given. The paper also discusses algorithms to compute the treewidth of given graphs, and how these are based on the different charac ..."
Abstract

Cited by 34 (2 self)
 Add to MetaCart
Abstract. This paper gives a short survey on algorithmic aspects of the treewidth of graphs. Some alternative characterizations and some applications of the notion are given. The paper also discusses algorithms to compute the treewidth of given graphs, and how these are based on the different
Algorithms for Graphs of (Locally) Bounded Treewidth
, 2001
"... Many reallife problems can be modeled by graphtheoretic problems. These graph problems are usually NPhard and hence there is no efficient algorithm for solving them, unless P= NP. One way to overcome this hardness is to solve the problems when restricted to special graphs. Trees are one kind of g ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
of graph for which several NPcomplete problems can be solved in polynomial time. Graphs of bounded treewidth, which generalize trees, show good algorithmic properties similar to those of trees. Using ideas developed for tree algorithms, Arnborg and Proskurowski introduced a general dynamic programming
Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
, 1995
"... Various parameters of graphs connected to sparse matrix factorization and other applications can be approximated using an algorithm of Leighton et al. that finds vertex separators of graphs. The approximate values of the parameters, which include minimum front size, treewidth, pathwidth, and minimum ..."
Abstract

Cited by 79 (5 self)
 Add to MetaCart
Various parameters of graphs connected to sparse matrix factorization and other applications can be approximated using an algorithm of Leighton et al. that finds vertex separators of graphs. The approximate values of the parameters, which include minimum front size, treewidth, pathwidth
Safe Separators for Treewidth
 IN PROCEEDINGS 6TH WORKSHOP ON ALGORITHM ENGINEERING AND EXPERIMENTS ALENEX04
, 2003
"... ..."
Treewidth Computations I. Upper Bounds
, 2008
"... For more and more applications, it is important to be able to compute the treewidth of a given graph and to find tree decompositions of small width reasonably fast. This paper gives an overview of several upper bound heuristics that have been proposed and tested for the problem of determining the tr ..."
Abstract

Cited by 26 (3 self)
 Add to MetaCart
For more and more applications, it is important to be able to compute the treewidth of a given graph and to find tree decompositions of small width reasonably fast. This paper gives an overview of several upper bound heuristics that have been proposed and tested for the problem of determining
I/Oefficient algorithms for graphs of bounded treewidth
 In Proceedings of the 12th Annual ACMSIAM Symposium on Discrete Algorithms (SODA’2001
, 2001
"... We present an algorithm that takes O(sort(N)) I/Os 1 to compute a tree decomposition of width at most k, for any graph G of treewidth at most k and size N. Given such a tree decomposition, we use a dynamic programming framework to solve a wide variety of problems on G in O(N/(DB)) I/Os, including th ..."
Abstract

Cited by 16 (5 self)
 Add to MetaCart
We present an algorithm that takes O(sort(N)) I/Os 1 to compute a tree decomposition of width at most k, for any graph G of treewidth at most k and size N. Given such a tree decomposition, we use a dynamic programming framework to solve a wide variety of problems on G in O(N/(DB)) I/Os, including
Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes
, 2002
"... In this paper, we present a onetoone embedding of a graph with bounded treewidth into its optimal hypercube. This is the first time that embeddings of graphs with a highly irregular structure into hypercubes are investigated. The presented embedding achieves dilation of at most 3�log��d + 1��t + 1 ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
, the embedding of a graph with constant treewidth and constant degree can be computed in time O�log 2 �n � log log log�n � log ∗ �n��. For graphs with constant treewidth, a minimal treedecomposition can be computed efficiently in parallel due to a result of Bodlaender and Hagerup. In this case, the embedding
Results 1  10
of
591