FAW
2008
Springer
14 years 1 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...
FAW
2008
Springer
14 years 1 months ago
2008
Springer
FAW
2008
Springer
14 years 1 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...
FAW
2008
Springer
14 years 1 months ago
2008
Springer
We study the parameterized complexity of an NP-complete geometric covering problem called d-dimensional Rectangle Stabbing where we are given a set of axis-parallel d-dimensional h...
FAW
2008
Springer
14 years 1 months ago
2008
Springer
FAW
2008
Springer
14 years 1 months ago
2008
Springer
FAW
2008
Springer
14 years 1 months ago
2008
Springer
Abstract. Closeness centrality is an important concept in social network analysis. In a graph representing a social network, closeness centrality measures how close a vertex is to ...
FAW
2008
Springer
14 years 1 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 ...
FAW
2008
Springer
14 years 1 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 ...