Sciweavers

Share
FAW
2008
Springer
127views Algorithms» more  FAW 2008»
8 years 6 months ago
Visiting a Polygon on the Optimal Way to a Query Point
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...
Ramtin Khosravi, Mohammad Ghodsi
FAW
2008
Springer
110views Algorithms» more  FAW 2008»
8 years 6 months ago
Estimating Hybrid Frequency Moments of Data Streams
Sumit Ganguly, Mohit Bansal, Shruti Dube
FAW
2008
Springer
111views Algorithms» more  FAW 2008»
8 years 6 months ago
Efficient First-Order Model-Checking Using Short Labels
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...
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha...
FAW
2008
Springer
104views Algorithms» more  FAW 2008»
8 years 6 months ago
The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants
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...
Michael Dom, Somnath Sikdar
FAW
2008
Springer
117views Algorithms» more  FAW 2008»
8 years 6 months ago
Characterizing and Computing Minimal Cograph Completions
Daniel Lokshtanov, Federico Mancini, Charis Papado...
FAW
2008
Springer
90views Algorithms» more  FAW 2008»
8 years 6 months ago
Computer Science in the Information Age
John E. Hopcroft
FAW
2008
Springer
104views Algorithms» more  FAW 2008»
8 years 6 months ago
Ranking of Closeness Centrality for Large-Scale Social Networks
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 ...
Kazuya Okamoto, Wei Chen, Xiang-Yang Li
FAW
2008
Springer
225views Algorithms» more  FAW 2008»
8 years 6 months ago
Versioning Tree Structures by Path-Merging
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 ...
Khaireel A. Mohamed, Tobias Langner, Thomas Ottman...
FAW
2008
Springer
137views Algorithms» more  FAW 2008»
8 years 6 months ago
Constraint Bipartite Vertex Cover: Simpler Exact Algorithms and Implementations
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 ...
Guoqiang Bai 0002, Henning Fernau
books