Results 1  10
of
3,051
Reduction Algorithms for Graphs of Small Treewidth
 Inf. Comput
, 1997
"... This paper presents a number of new ideas and results on graph reduction applied to graphs of bounded treewidth. Arnborg et al. have shown that many decision problems on graphs can be solved in linear time on graphs of bounded treewidth, by using a finite set of reduction rules. These algorithms can ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
be solved in this way on graphs of small treewidth. Additionally we show that the results of Bodlaender and Hagerup can be applied to our reduction algorithms that use O(n) operations and O(log n log*n) time on an EREW PRAM or O(log n) time on a CRCW PRAM.
Reduction Algorithms for Graphs with Small Treewidth
 In Proceedings 19th International Workshop on GraphTheoretic Concepts in Computer Science WG'93
, 1995
"... This paper presents some new ideas and results on graph reduction applied to graphs with bounded treewidth. Arnborg et al. [2] have shown that many decision problems on graphs can be solved in linear time on graphs with bounded treewidth, by using a finite set of reduction rules. We show that this m ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
This paper presents some new ideas and results on graph reduction applied to graphs with bounded treewidth. Arnborg et al. [2] have shown that many decision problems on graphs can be solved in linear time on graphs with bounded treewidth, by using a finite set of reduction rules. We show
Solving dSAT via Backdoors to Small Treewidth
"... A backdoor set of a CNF formula is a set of variables such that fixing the truth values of the variables from this set moves the formula into a polynomialtime decidable class. In this work we obtain several algorithmic results for solving dSAT, by exploiting backdoors to dCNF formulas whose incid ..."
Abstract
 Add to MetaCart
incidence graphs have small treewidth. For a CNF formula φ and integer t, a strong backdoor set to treewidth t is a set of variables such that each possible partial assignment τ to this set reduces φ to a formula whose incidence graph is of treewidth at most t. A weak backdoor set to treewidth t is a set
Compact Navigation and Distance Oracles for Graphs with Small Treewidth ⋆
"... Abstract. Given an unlabeled, unweighted, and undirected graph with n vertices and small (but not necessarily constant) treewidth k, we consider the problem of preprocessing the graph to build spaceefficient encodings (oracles) to perform various queries efficiently. We assume the word RAM model wh ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. Given an unlabeled, unweighted, and undirected graph with n vertices and small (but not necessarily constant) treewidth k, we consider the problem of preprocessing the graph to build spaceefficient encodings (oracles) to perform various queries efficiently. We assume the word RAM model
Structured Programs have Small TreeWidth and Good Register Allocation
 Information and Computation
, 1995
"... The register allocation problem for an imperative program is often modelled as the coloring problem of the interference graph of the controlflow graph of the program. The interference graph of a flow graph G is the intersection graph of some connected subgraphs of G. These connected subgraphs repre ..."
Abstract

Cited by 66 (1 self)
 Add to MetaCart
(n " ) from optimality unless NP=P. It is shown that if a graph has treewidth k, we can efficiently color any intersection graph of connected subgraphs within a factor (bk=2c + 1) from optimality. Moreover, it is shown that structured (j gotofree) programs, including, for example, short circuit
Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms
, 1995
"... We consider the problem of preprocessing an nvertex digraph with real edge weights so that subsequent queries for the shortest path or distance between any two vertices can be efficiently answered. We give algorithms that depend on the treewidth of the input graph. When the treewidth is a consta ..."
Abstract

Cited by 37 (4 self)
 Add to MetaCart
We consider the problem of preprocessing an nvertex digraph with real edge weights so that subsequent queries for the shortest path or distance between any two vertices can be efficiently answered. We give algorithms that depend on the treewidth of the input graph. When the treewidth is a
GRAPHS OF SMALL RANKWIDTH ARE PIVOTMINORS OF GRAPHS OF SMALL TREEWIDTH
"... Abstract. We prove that every graph of rankwidth k is a pivotminor of a graph of treewidth at most 2k. We also prove that graphs of rankwidth at most 1, equivalently distancehereditary graphs, are exactly vertexminors of trees, and graphs of linear rankwidth at most 1 are precisely vertexmin ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Abstract. We prove that every graph of rankwidth k is a pivotminor of a graph of treewidth at most 2k. We also prove that graphs of rankwidth at most 1, equivalently distancehereditary graphs, are exactly vertexminors of trees, and graphs of linear rankwidth at most 1 are precisely vertex
Results 1  10
of
3,051