Add to ORKGIn this paper we present a parallel algorithm that decides whether a graph G has treewidth at most two, and if so, construct a tree decomposition or path decomposition of minimum width of G. The algorithm uses O(n) operations and O(lognlog n) time on an EREW PRAM, or O(logn) time on a CRCW PRAM. The algorithm makes use of the resemblance between series parallel graphs and partial two-trees. It is a (non-trivial) extension of the parallel algorithm for series parallel graphs that is presented in [8]
We consider the problem of preprocessing an n-vertex digraph with real edge weights so that subseque...
Some new ideas are presented on graph reduction applied to graphs with bounded treewidth. It is show...
The tree-layout problem is to compute the coordinates of nodes of a tree so that the tree, when draw...
We describe the first parallel algorithm with optimal speedup for constructing minimum-width tree de...
The length of a tree-decomposition of a graph is the maximum distance between two vertices of a same...
In this paper, a parallel algorithm is given that, given a graph G = (V; E), decides whether G is a ...
AbstractThe bisection width b(G) of a graph G is the number of edges necessary in an edge cut of G s...
We consider the problem of preprocessing an $n$-vertex digraph with real edge weights so that subseq...
International audienceThe length of a tree-decomposition of a graph is the maximum distance (in the ...
AbstractWe consider the problem of preprocessing an n-vertex digraph with real edge weights so that ...
We consider the problem of preprocessing an n-vertex digraph with real edge weights so that subseque...
The notions of pathwidth and the closely related treewidth have become more and more important recen...
We consider the problem of preprocessing an $n$-vertex digraph with real edge weights so that subseq...
We describe the first parallel algorithm with optimal speedup for constructing minimum-width tree de...
In this paper we give, for all constants k, l , explicit algorithms, that given a graph G = (V, E) ...
We consider the problem of preprocessing an n-vertex digraph with real edge weights so that subseque...
Some new ideas are presented on graph reduction applied to graphs with bounded treewidth. It is show...
The tree-layout problem is to compute the coordinates of nodes of a tree so that the tree, when draw...
We describe the first parallel algorithm with optimal speedup for constructing minimum-width tree de...
The length of a tree-decomposition of a graph is the maximum distance between two vertices of a same...
In this paper, a parallel algorithm is given that, given a graph G = (V; E), decides whether G is a ...
AbstractThe bisection width b(G) of a graph G is the number of edges necessary in an edge cut of G s...
We consider the problem of preprocessing an $n$-vertex digraph with real edge weights so that subseq...
International audienceThe length of a tree-decomposition of a graph is the maximum distance (in the ...
AbstractWe consider the problem of preprocessing an n-vertex digraph with real edge weights so that ...
We consider the problem of preprocessing an n-vertex digraph with real edge weights so that subseque...
The notions of pathwidth and the closely related treewidth have become more and more important recen...
We consider the problem of preprocessing an $n$-vertex digraph with real edge weights so that subseq...
We describe the first parallel algorithm with optimal speedup for constructing minimum-width tree de...
In this paper we give, for all constants k, l , explicit algorithms, that given a graph G = (V, E) ...
We consider the problem of preprocessing an n-vertex digraph with real edge weights so that subseque...
Some new ideas are presented on graph reduction applied to graphs with bounded treewidth. It is show...
The tree-layout problem is to compute the coordinates of nodes of a tree so that the tree, when draw...