AbstractThe bisection width b(G) of a graph G is the number of edges necessary in an edge cut of G so that the two sides of the cut have equal (within one element) size. Our main result is an O(n2) processor O(log2n loglogn) time parallel algorithm for determining b(T) when T is a tree
We present the first near-linear work and poly-logarithmic depth algorithm for computing a minimum c...
We present a tree difference algorithm with expected sequential execution time O(n log log n) and ex...
Abstract. For a connected graph, a vertex separator is a set of vertices whose removal creates at le...
AbstractThe bisection width b(G) of a graph G is the number of edges necessary in an edge cut of G s...
In this paper we present a parallel algorithm that decides whether a graph G has treewidth at most t...
[[abstract]]An edge is a bisector of a simple path if it contains the middle point of the path. In t...
We describe the first parallel algorithm with optimal speedup for constructing minimum-width tree de...
The tree-layout problem is to compute the coordinates of nodes of a tree so that the tree, when draw...
Some new ideas are presented on graph reduction applied to graphs with bounded treewidth. It is show...
A graph G has tree-width at most w if it admits a tree-decomposition of width ≤ w. It is known that ...
The minimum cut and minimum length linear arrangement problems usually occur in solving wiring probl...
The minimum cut and minimum length linear arrangement problems usually occur in solving wiring probl...
The minimum cut and minimum length linear arrangement problems usually occur in solving wiring probl...
We describe the first parallel algorithm with optimal speedup for constructing minimum-width tree de...
Refinement of the unit simplex by iterative longest edge bisection (LEB) up to sub-simplices have a ...
We present the first near-linear work and poly-logarithmic depth algorithm for computing a minimum c...
We present a tree difference algorithm with expected sequential execution time O(n log log n) and ex...
Abstract. For a connected graph, a vertex separator is a set of vertices whose removal creates at le...
AbstractThe bisection width b(G) of a graph G is the number of edges necessary in an edge cut of G s...
In this paper we present a parallel algorithm that decides whether a graph G has treewidth at most t...
[[abstract]]An edge is a bisector of a simple path if it contains the middle point of the path. In t...
We describe the first parallel algorithm with optimal speedup for constructing minimum-width tree de...
The tree-layout problem is to compute the coordinates of nodes of a tree so that the tree, when draw...
Some new ideas are presented on graph reduction applied to graphs with bounded treewidth. It is show...
A graph G has tree-width at most w if it admits a tree-decomposition of width ≤ w. It is known that ...
The minimum cut and minimum length linear arrangement problems usually occur in solving wiring probl...
The minimum cut and minimum length linear arrangement problems usually occur in solving wiring probl...
The minimum cut and minimum length linear arrangement problems usually occur in solving wiring probl...
We describe the first parallel algorithm with optimal speedup for constructing minimum-width tree de...
Refinement of the unit simplex by iterative longest edge bisection (LEB) up to sub-simplices have a ...
We present the first near-linear work and poly-logarithmic depth algorithm for computing a minimum c...
We present a tree difference algorithm with expected sequential execution time O(n log log n) and ex...
Abstract. For a connected graph, a vertex separator is a set of vertices whose removal creates at le...
DOI
Add to ORKG