39 search results - page 7 / 8 » On the Diameter of Lattice Polytopes |
CORR
2011
Springer
14 years 4 months ago
2011
Springer
A model for statistical ranking is a family of probability distributions whose states are orderings of a xed nite set of items. We represent the orderings as maximal chains in a ...
DCG
2008
14 years 9 months ago
2008
In this paper we study connections between planar graphs, Schnyder woods, and orthogonal surfaces. Schnyder woods and the face counting approach have important applications in gra...
ESA
2003
Springer
15 years 2 months ago
2003
Springer
In this paper we propose algorithms for solving a variety of geometric optimization problems on a stream of points in R2 or R3 . These problems include various extent measures (e.g...
101
click to vote
PODC
2004
ACM
15 years 3 months ago
2004
ACM
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
COCOON
1999
Springer
15 years 1 months ago
1999
Springer
We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...