Sciweavers

344 search results - page 37 / 69
» Random Walks on Colored Graphs
Sort
View
JGT
2010
81views more  JGT 2010»
13 years 6 months ago
Cycles and paths in edge-colored graphs with given degrees
Sufficient degree conditions for the existence of properly edge-colored cycles and paths in edge-colored graphs, multigraphs and random graphs are inverstigated. In particular, we...
A. Abouelaoualim, Kinkar Chandra Das, Wenceslas Fe...
VTC
2006
IEEE
121views Communications» more  VTC 2006»
14 years 1 months ago
Location-Dependent Parameterization of a Random Direction Mobility Model
— Mobility models are widely used in simulation-based performance analyses of mobile networks. However, there is a trade-off between simplicity and realistic movement patterns. S...
Bernd Gloss, Michael Scharf, Daniel Neubauer
CIKM
2008
Springer
13 years 9 months ago
Dr. Searcher and Mr. Browser: a unified hyperlink-click graph
We introduce a unified graph representation of the Web, which includes both structural and usage information. We model this graph using a simple union of the Web's hyperlink ...
Barbara Poblete, Carlos Castillo, Aristides Gionis
PERCOM
2005
ACM
14 years 7 months ago
The Area Graph-Based Mobility Model and Its Impact on Data Dissemination
When analyzing dissemination protocols in mobile adhoc networks the underlying mobility model is an important factor because it strongly influences the performance of these protoc...
Sven Bittner, Wolf-Ulrich Raffel, Manuel Scholz
DCC
2007
IEEE
14 years 7 months ago
Distributed Functional Compression through Graph Coloring
We consider the distributed computation of a function of random sources with minimal communication. Specifically, given two discrete memoryless sources, X and Y , a receiver wishe...
Devavrat Shah, Muriel Médard, Sidharth Jagg...