28 search results - page 5 / 6 » Counting Plane Graphs: Flippability and its Applications |
SPAA
2005
ACM
15 years 3 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
SODA
2012
ACM
12 years 12 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...
90
Voted
CONSTRAINTS
2008
14 years 9 months ago
2008
The tree constraint partitions a directed graph into node-disjoint trees. In many practical applications that involve such a partition, there exist side constraints specifying requ...
100
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
A sequence is nonrepetitive if it does not contain two adjacent identical blocks. The remarkable construction of Thue asserts that 3 symbols are enough to build an arbitrarily long...
78
Voted
FOCS
2003
IEEE
15 years 2 months ago
2003
IEEE
The doubling constant of a metric space (X, d) is the smallest value λ such that every ball in X can be covered by λ balls of half the radius. The doubling dimension of X is the...