Sciweavers

1528 search results - page 54 / 306
» On Signatures for Communication Graphs
Sort
View
JGAA
2007
93views more  JGAA 2007»
13 years 7 months ago
Large-Graph Layout Algorithms at Work: An Experimental Study
In the last decade several algorithms that generate straight-line drawings of general large graphs have been invented. In this paper we investigate some of these methods that are ...
Stefan Hachul, Michael Jünger
JGAA
2002
81views more  JGAA 2002»
13 years 7 months ago
Graph Drawing in Motion
Enabling the user of a graph drawing system to preserve the mental map between two different layouts of a graph is a major problem. In this paper we present methods that smoothly ...
Carsten Friedrich, Peter Eades
SIGMETRICS
2010
ACM
147views Hardware» more  SIGMETRICS 2010»
13 years 6 months ago
On random walks in direction-aware network problems
Graph theory provides a powerful set of metrics and conceptual ideas to model and investigate the behavior of communication networks. Most graph-theoretical frameworks in the netw...
Ali Tizghadam, Alberto Leon-Garcia
COMSUR
2011
219views Hardware» more  COMSUR 2011»
12 years 7 months ago
Link Scheduling Algorithms for Wireless Mesh Networks
Abstract—We provide an overview of link scheduling algorithms in Spatial Time Division Access (STDMA) wireless mesh networks. These algorithms can be classified into three categ...
Ashutosh Deepak Gore, Abhay Karandikar
SPAA
2005
ACM
14 years 1 months ago
The expansion and mixing time of skip graphs with applications
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph, and estimate the quality of the expansion via simulations. As a consequence skip grap...
James Aspnes, Udi Wieder