Sciweavers

9 search results - page 2 / 2
» Transforming spanning trees and pseudo-triangulations
Sort
View
GD
2005
Springer
13 years 10 months ago
Visualizing Graphs as Trees: Plant a Seed and Watch it Grow
TreePlus is a graph browsing technique based on a tree-style layout. It shows the missing graph structure using interaction techniques and enables users to start with a specific no...
Bongshin Lee, Cynthia Sims Parr, Catherine Plaisan...
RSA
2010
108views more  RSA 2010»
13 years 3 months ago
Resolvent of large random graphs
We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and deri...
Charles Bordenave, Marc Lelarge
CDC
2009
IEEE
126views Control Systems» more  CDC 2009»
13 years 10 months ago
H2 performance of agreement protocol with noise: An edge based approach
— This work presents an H2 performance analysis of the agreement protocol in the presence of noise. The agreement protocol is first transformed into an equivalent system induced...
Daniel Zelazo, Mehran Mesbahi
ALGORITHMICA
2002
101views more  ALGORITHMICA 2002»
13 years 5 months ago
Improved Algorithms for Constructing Fault-Tolerant Spanners
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct k-fault-tolerant spanners for S. If in such a spanner at most k vertice...
Christos Levcopoulos, Giri Narasimhan, Michiel H. ...