Sciweavers

990 search results - page 105 / 198
» Sub-Graphs of Complete Graph
Sort
View
132
Voted
STOC
1997
ACM
76views Algorithms» more  STOC 1997»
15 years 7 months ago
Exploring Unknown Environments
We consider exploration problems where a robot has to construct a complete map of an unknown environment. We assume that the environment is modeled by a directed, strongly connecte...
Susanne Albers, Monika Rauch Henzinger
IC
2003
15 years 4 months ago
Sampling Internet Topologies: How Small Can We Go?
Abstract— In this paper, we develop methods to “sample” a large real network into a small realistic graph. Although topology modeling has received a lot attention lately, it ...
Vaishnavi Krishnamurthy, Junhong Sun, Michalis Fal...
CORR
2010
Springer
103views Education» more  CORR 2010»
15 years 3 months ago
Random Information Spread in Networks
Let G = (V, E) be an undirected loopless graph with possible parallel edges and s, t V . Assume that s is labelled at the initial time step and that every labelled vertex copies i...
Raymond Lapus, Frank Simon, Peter Tittmann
CCR
2004
119views more  CCR 2004»
15 years 3 months ago
Collecting the internet AS-level topology
At the inter-domain level, the Internet topology can be represented by a graph with Autonomous Systems (ASes) as nodes and AS peerings as links. This AS-level topology graph has b...
Beichuan Zhang, Raymond A. Liu, Daniel Massey, Lix...
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
15 years 10 months ago
Shifting Strategy for Geometric Graphs without Geometry
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
Imran A. Pirwani