Sciweavers

1545 search results - page 123 / 309
» On tree congestion of graphs
Sort
View
STOC
2009
ACM
171views Algorithms» more  STOC 2009»
15 years 10 months ago
On the geometry of graphs with a forbidden minor
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
James R. Lee, Anastasios Sidiropoulos
SPAA
2009
ACM
15 years 10 months ago
On randomized representations of graphs using short labels
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
Pierre Fraigniaud, Amos Korman
FOCS
2008
IEEE
15 years 4 months ago
Nearly Tight Low Stretch Spanning Trees
We prove that any graph G with n points has a distribution T over spanning trees such that for any edge (u, v) the expected stretch ET ∼T [dT (u, v)/dG(u, v)] is bounded by ˜O(...
Ittai Abraham, Yair Bartal, Ofer Neiman
IPPS
2005
IEEE
15 years 3 months ago
Self-Stabilizing Anonymous Leader Election in a Tree
We propose a new self-stabilizing anonymous leader election algorithm in a tree graph. We show the correctness of the protocol and show that the protocol terminates in O(n4 ) time...
Zhenyu Xu, Pradip K. Srimani
GECCO
2004
Springer
152views Optimization» more  GECCO 2004»
15 years 3 months ago
Ant System for the k-Cardinality Tree Problem
This paper gives an algorithm for finding the minimum weight tree having k edges in an edge weighted graph. The algorithm combines a search and optimization technique based on phe...
Thang Nguyen Bui, Gnanasekaran Sundarraj