Sciweavers

4865 search results - page 20 / 973
» The Complexity of Graph Connectivity
Sort
View
SPAA
2005
ACM
14 years 1 months ago
Peer-to-peer networks based on random transformations of connected regular undirected graphs
We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k +2 edges it interchanges the end vertices of the path. By defin...
Peter Mahlmann, Christian Schindelhauer
WAW
2007
Springer
120views Algorithms» more  WAW 2007»
14 years 1 months ago
Giant Component and Connectivity in Geographical Threshold Graphs
The geographical threshold graph model is a random graph model with nodes distributed in a Euclidean space and edges assigned through a function of distance and node weights. We st...
Milan Bradonjic, Aric A. Hagberg, Allon G. Percus
ORL
2008
115views more  ORL 2008»
13 years 7 months ago
Maximum algebraic connectivity augmentation is NP-hard
The algebraic connectivity of a graph, which is the second-smallest eigenvalue of the Laplacian of the graph, is a measure of connectivity. We show that the problem of adding a sp...
Damon Mosk-Aoyama
GD
2006
Springer
13 years 11 months ago
SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding
Abstract. We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Classical Multi-Dimensional Scaling yields a quadratictime spectral algorithm,...
Ali Civril, Malik Magdon-Ismail, Eli Bocek-Rivele
AGENTS
1997
Springer
13 years 12 months ago
Learning View Graphs for Robot Navigation
Abstract. We present a purely vision-based scheme for learning a topological representation of an open environment. The system represents selected places by local views of the surr...
Matthias O. Franz, Bernhard Schölkopf, Philip...