271 search results - page 18 / 55 » Quasi-isometries between graphs and trees |
IJCM
2002
13 years 7 months ago
2002
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
GC
2004
Springer
14 years 1 months ago
2004
Springer
This paper presents a locality-based dissemination graph algorithm for scalable reliable broadcast. Our algorithm scales in terms of both network and memory usage. Processes only h...
COCOON
2003
Springer
14 years 25 days ago
2003
Springer
Drugs and other chemical compounds are often modeled as polygonal shapes, where each vertex represents an atom of the molecule, and covalent bonds between atoms are represented by...
ISBRA
2009
Springer
14 years 2 months ago
2009
Springer
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
SPAA
2010
ACM
14 years 12 days ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...