Sciweavers

828 search results - page 11 / 166
» Simplicial Powers of Graphs
Sort
View
CISS
2008
IEEE
14 years 3 months ago
Distributed computation of a sparse cover in sensor networks without location information
— In this paper, we present a distributed algorithm for detecting redundancies in a sensor network with no location information. We demonstrate how, in the absence of localizatio...
Alireza Tahbaz-Salehi, Ali Jadbabaie
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 8 months ago
The Degree Distribution of Random k-Trees
A power law degree distribution is established for a graph evolution model based on the graph class of k-trees. This k-tree-based graph process can be viewed as an idealized model...
Yong Gao
TCS
1998
13 years 8 months ago
A Partial k-Arboretum of Graphs with Bounded Treewidth
The notion of treewidth has seen to be a powerful vehicle for many graph algorithmic studies. This survey paper wants to give an overview of many classes of graphs that can be see...
Hans L. Bodlaender
FOCS
1994
IEEE
14 years 21 days ago
The Power of Team Exploration: Two Robots Can Learn Unlabeled Directed Graphs
We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new typ...
Michael A. Bender, Donna K. Slonim
ALENEX
2003
137views Algorithms» more  ALENEX 2003»
13 years 10 months ago
The Markov Chain Simulation Method for Generating Connected Power Law Random Graphs
Graph models for real-world complex networks such as the Internet, the WWW and biological networks are necessary for analytic and simulation-based studies of network protocols, al...
Christos Gkantsidis, Milena Mihail, Ellen W. Zegur...