251 search results - page 2 / 51 » Constructive Linear Time Algorithms for Branchwidth |
AMAI
2006
Springer
13 years 5 months ago
2006
Springer
We present a tableau-based algorithm for obtaining a B
TCBB
2011
13 years 21 days ago
2011
—We study the problem of merging genetic maps, when the individual genetic maps are given as directed acyclic graphs. The computational problem is to build a consensus map, which...
DCC
2009
IEEE
14 years 6 months ago
2009
IEEE
We present a linear time and space suffix array (SA) construction algorithm called the SA-IS algorithm. The SA-IS algorithm is novel because of the LMS-substrings used for the pro...
OPODIS
2001
13 years 7 months ago
2001
In their pioneering paper [4], Gallager et al. introduced a distributed algorithm for constructing the minimum-weight spanning tree (MST), many authors have suggested ways to enhan...
SIAMCOMP
1998
13 years 5 months ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...