Sciweavers

1370 search results - page 11 / 274
» On grids in topological graphs
Sort
View
FSTTCS
2005
Springer
14 years 1 months ago
The Directed Planar Reachability Problem
We investigate the s-t-connectivity problem for directed planar graphs, which is hard for L and is contained in NL but is not known to be complete. We show that this problem is log...
Eric Allender, Samir Datta, Sambuddha Roy
CDC
2010
IEEE
100views Control Systems» more  CDC 2010»
13 years 3 months ago
A resistance-based approach to consensus algorithm performance analysis
Abstract-We study the well known linear consensus algorithm by means of a LQ-type performance cost. We want to understand how the communication topology influences this algorithm. ...
Federica Garin, Enrico Lovisari, Sandro Zampieri
INFOCOM
2012
IEEE
11 years 11 months ago
Impact of power-law topology on IP-level routing dynamics: Simulation results
—This paper focuses on the Internet IP-level routing topology and proposes relevant explanations to its apparent dynamics. We first represent this topology as a power-law random...
Amelie Medem Kuatse, Clémence Magnien, Fabi...
VG
2001
13 years 9 months ago
Topology-Guided Downsampling
We present a new downsampling method for structured volume grids, which preserves much more of the topology of a scalar field than existing downsampling methods by preferably selec...
Martin Kraus, Thomas Ertl
AAAI
1996
13 years 9 months ago
Integrating Grid-Based and Topological Maps for Mobile Robot Navigation
Research on mobile robot navigation has produced two major paradigms for mapping indoorenvironments: grid-based and topological. While grid-based methods produce accurate metric m...
Sebastian Thrun, Arno Bücken