Sciweavers

1664 search results - page 141 / 333
» Distance labeling in graphs
Sort
View
CDC
2008
IEEE
109views Control Systems» more  CDC 2008»
15 years 11 months ago
Control of acyclic formations of mobile autonomous agents
— This paper proposes distributed control laws for maintaining the shape of a formation of mobile autonomous agents in the plane for which the desired shape is defined in terms ...
Ming Cao, Brian D. O. Anderson, A. Stephen Morse, ...
ALGORITHMICA
1999
99views more  ALGORITHMICA 1999»
15 years 4 months ago
Evolutionary Trees and Ordinal Assertions
Sequence data for a group of species is often summarized by a distance matrix M where M[s, t] is the dissimilarity between the sequences of species s and t. An ordinal assertion is...
Paul E. Kearney, Ryan Hayward, Henk Meijer
128
Voted
SODA
2004
ACM
98views Algorithms» more  SODA 2004»
15 years 6 months ago
End-to-end packet-scheduling in wireless ad-hoc networks
Abstract Packet-scheduling is a particular challenge in wireless networks due to interference from nearby transmissions. A distance-2 interference model serves as a useful abstract...
V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Pa...
EJC
2008
15 years 3 months ago
Locating sensors in paths and cycles: The case of 2-identifying codes
For a graph G and a set D V (G), define Nr[x] = {xi V (G) : d(x, xi) r} (where d(x, y) is graph theoretic distance) and Dr(x) = Nr[x] D. D is known as an r-identifying code if...
David L. Roberts, Fred S. Roberts
126
Voted
IPPS
2003
IEEE
15 years 10 months ago
Channel Assignment on Strongly-Simplicial Graphs
Given a vector ( 1 2 ::: t) of non increasing positive integers, and an undirected graph G = (V E), an L( 1 2 ::: t)-coloring of G is a function f from the vertex set V to a set o...
Alan A. Bertossi, Maria Cristina Pinotti, Romeo Ri...