1421 search results - page 39 / 285 » Algorithms for subsequence combinatorics |
167
Voted
COCOON
2004
Springer
15 years 8 months ago
2004
Springer
The problem of efficiently monitoring the network flow is regarded as the one to find out the minimum weighted weak vertex cover set for a given graph G = (V, E) with weight func...
117
click to vote
CPM
2001
Springer
15 years 7 months ago
2001
Springer
Directed Acyclic Word Graph (DAWG) is a space efficient data structure that supports indices of a string. Compact Directed Acyclic Word Graph (CDAWG) is a more space efficient vari...
109
click to vote
COCOON
2005
Springer
15 years 8 months ago
2005
Springer
We present a simple linear time algorithm for drawing level graphs with a given ordering of the vertices within each level. The algorithm draws in a radial fashion without changing...
124
Voted
COCOON
2005
Springer
15 years 8 months ago
2005
Springer
We study the edge-connectivity survivable network design problem with an additional linear budget constraint. We give a strongly polynomial time (3, 3)-approximation algorithm for ...
131
Voted
CPM
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Ambiguity in dynamic programming arises from two independent sources, the non-uniqueness of optimal solutions and the particular recursion scheme by which the search spac...