829 search results - page 145 / 166 » Distance domination-critical graphs |
106
click to vote
TALG
2008
14 years 11 months ago
2008
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
AUTOMATICA
2007
2007
Three and higher dimensional autonomous formations: Rigidity, persistence and structural persistence
14 years 12 months ago
In this paper, we generalize the notion of persistence, which has been originally introduced for two-dimensional formations, to Rd for d 3, seeking to provide a theoretical framew...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
In recent years, considerable advances have been made in the study of properties of metric spaces in terms of their doubling dimension. This line of research has not only enhanced...
112
click to vote
ALGORITHMICA
2011
14 years 6 months ago
2011
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
108
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and it...