328 search results - page 9 / 66 » An O(log n log log n) space algorithm for undirected st-conn... |
ORL
1998
13 years 8 months ago
1998
Recently, Becker and Geiger and Bafna, Berman and Fujito gave 2-approximation algorithms for the feedback vertex set problem in undirected graphs. We show how their algorithms can...
WEA
2005
Springer
14 years 2 months ago
2005
Springer
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
SPATIALCOGNITION
2004
Springer
14 years 1 months ago
2004
Springer
This paper presents a very efficient SLAM algorithm that works by hierarchically dividing the map into local regions and subregions. At each level of the hierarchy each region stor...
SIAMCOMP
2008
13 years 8 months ago
2008
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
COCO
2010
Springer
14 years 16 days ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...