Sciweavers

1172 search results - page 107 / 235
» Path Algorithms on Regular Graphs
Sort
View
134
Voted
CONCUR
2006
Springer
15 years 6 months ago
Strategy Improvement for Stochastic Rabin and Streett Games
A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions specified as Ra...
Krishnendu Chatterjee, Thomas A. Henzinger
153
Voted
CORR
2010
Springer
180views Education» more  CORR 2010»
15 years 7 hour ago
Shortest path problem in rectangular complexes of global nonpositive curvature
Abstract. CAT(0) metric spaces constitute a far-reaching common generalization of Euclidean and hyperbolic spaces and simple polygons: any two points x and y of a CAT(0) metric spa...
Victor Chepoi, Daniela Maftuleac
122
Voted
ICRA
2010
IEEE
131views Robotics» more  ICRA 2010»
15 years 1 months ago
Optimal coverage of a known arbitrary environment
— The problem of coverage of known space by a mobile robot has many applications. Of particular interest is providing a solution that guarantees the complete coverage of the free...
Raphael Mannadiar, Ioannis M. Rekleitis
141
Voted
BMCBI
2010
183views more  BMCBI 2010»
15 years 2 months ago
SING: Subgraph search In Non-homogeneous Graphs
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
Raffaele Di Natale, Alfredo Ferro, Rosalba Giugno,...
DAM
2010
167views more  DAM 2010»
15 years 2 months ago
A new characterization of P6-free graphs
We study P6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph G is P6-free if an...
Pim van 't Hof, Daniël Paulusma