Sciweavers

1434 search results - page 10 / 287
» Graph Searching with Advice
Sort
View
SWAT
1994
Springer
126views Algorithms» more  SWAT 1994»
14 years 20 days ago
Optimal Parametric Search on Graphs of Bounded Tree-Width
We give linear-time algorithms for a class of parametric search problems on weighted graphs of bounded tree-width. We also discuss the implications of our results to approximate p...
David Fernández-Baca, Giora Slutzki
OPODIS
2007
13 years 10 months ago
The Cost of Monotonicity in Distributed Graph Searching
Abstract. Blin et al. (2006) proposed a distributed protocol that enables the smallest number of searchers to clear any unknown asynchronous graph in a decentralized manner. Unknow...
David Ilcinkas, Nicolas Nisse, David Soguet
SSS
2009
Springer
107views Control Systems» more  SSS 2009»
14 years 3 months ago
A Self-stabilizing Algorithm for Graph Searching in Trees
Graph searching games have been extensively studied in the past years. The graph searching problem involves a team of searchers who are attempting to capture a fugitive moving alon...
Rodica Mihai, Morten Mjelde
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
14 years 8 days ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch
ICPP
2006
IEEE
14 years 2 months ago
Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
David A. Bader, Kamesh Madduri