Sciweavers

970 search results - page 76 / 194
» On encodings of spanning trees
Sort
View
HYBRID
2009
Springer
15 years 7 months ago
Distributed Tree Rearrangements for Reachability and Robust Connectivity
This paper studies connectivity maintenance in robotic networks. We propose a distributed coordination algorithm that can be combined with the individual motion control strategies ...
Michael Schuresko, Jorge Cortés
97
Voted
PR
2007
81views more  PR 2007»
15 years 4 days ago
Graph embedding using tree edit-union
In this paper we address the problem of how to learn a structural prototype that can be used to represent the variations present in a set of trees. The prototype serves as a patte...
Andrea Torsello, Edwin R. Hancock
88
Voted
JCO
2010
67views more  JCO 2010»
14 years 11 months ago
Galaxy cutsets in graphs
Given a network G = (V, E), we say that a subset of vertices S ⊆ V has radius r if it is spanned by a tree of depth at most r. We are interested in determining whether G has a cu...
Nicolas Sonnerat, Adrian Vetta
XIMEP
2005
ACM
126views Database» more  XIMEP 2005»
15 years 6 months ago
Purely Relational FLWORs
We report on a compilation procedure that derives relational algebra plans from arbitrarily nested XQuery FLWOR blocks. While recent research was able to develop relational encodi...
Torsten Grust
115
Voted
INFOCOM
1999
IEEE
15 years 5 months ago
A Reliable, Efficient Topology Broadcast Protocol for Dynamic Networks
We present, prove correctness for, and evaluate a protocol for the reliable broadcast of topology and link-state information in a multihop communication network with a dynamic topo...
Bhargav R. Bellur, Richard G. Ogier