Sciweavers

10 search results - page 1 / 2
» faw 2008
Sort
View
FAW
2008
Springer
90views Algorithms» more  FAW 2008»
13 years 11 months ago
Computer Science in the Information Age
John E. Hopcroft
FAW
2008
Springer
117views Algorithms» more  FAW 2008»
13 years 11 months ago
Characterizing and Computing Minimal Cograph Completions
Daniel Lokshtanov, Federico Mancini, Charis Papado...
FAW
2008
Springer
110views Algorithms» more  FAW 2008»
13 years 11 months ago
Estimating Hybrid Frequency Moments of Data Streams
Sumit Ganguly, Mohit Bansal, Shruti Dube
FAW
2008
Springer
127views Algorithms» more  FAW 2008»
13 years 11 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
137views Algorithms» more  FAW 2008»
13 years 11 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