Sciweavers

2304 search results - page 171 / 461
» On the Vulnerability of Large Graphs
Sort
View
COMBINATORICA
2010
15 years 3 months ago
A randomized embedding algorithm for trees
In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a "self-avoiding tree-indexed random ...
Benny Sudakov, Jan Vondrák
INFOCOM
2011
IEEE
14 years 10 months ago
Fine-grained location-free planarization in wireless sensor networks
—Extracting planar graph from network topologies is of great importance for efficient protocol design in wireless ad hoc and sensor networks. Previous techniques of planar topol...
Dezun Dong, Yunhao Liu, Xiangke Liao, Xiang-Yang L...
GIS
2008
ACM
16 years 7 months ago
Applying hierarchical graphs to pedestrian indoor navigation
In this paper we propose to apply hierarchical graphs to indoor navigation. The intended purpose is to guide humans in large public buildings and assist them in wayfinding. We sta...
Edgar-Philipp Stoffel, Hans Jürgen Ohlbach, K...
PERCOM
2008
ACM
16 years 27 days ago
TIGRA: Timely Sensor Data Collection Using Distributed Graph Coloring
In this paper we present a protocol for sensor applications that require periodic collection of raw data reports from the entire network in a timely manner. We formulate the probl...
Lilia Paradis, Qi Han
IAT
2007
IEEE
16 years 26 days ago
Analysis of Multi-Actor Policy Contexts Using Perception Graphs
Policy making is a multi-actor process: it involves a variety of actors, each trying to further their own interests. How these actors decide and act largely depends on the way the...
Pieter W. G. Bots