118
Voted
FAW
15 years 2 months ago
2008 Springer 
We propose path-merging as a refinement of techniques used to make linked data structures partially persistent. Path-merging supports bursts of operations between any two adjacent ...
113
Voted
FAW
15 years 2 months ago
2008 Springer 
constraint bipartite vertex cover is a graph-theoretical formalization of the spare allocation problem for reconfigurable arrays. We report on an implementation of a parameterized ...
113
click to vote
FAW
15 years 2 months ago
2008 Springer 
Abstract. We study a constrained version of the shortest path problem in polygonal domains, in which the path must visit a given target polygon. We provide an efficient algorithm f...
101
Voted
FAW
15 years 2 months ago
2008 Springer  103
Voted
FAW
15 years 2 months ago
2008 Springer 
We prove that there exists an O(log(n))-labeling scheme for every first-order formula with free set variables in every class of graphs that is nicely locally cwd-decomposable, whic...
|
Algorithms