3 search results - page 1 / 1 » Near automorphisms of trees with small total relative displa... |
JCO
2007
13 years 4 months ago
2007
WINE
2005
Springer
13 years 10 months ago
2005
Springer
We study a model of path-vector routing in which nodes’ routing policies are based on subjective cost assessments of alternative routes. The routes are constrained by the requir...
ALGORITHMICA
1998
13 years 4 months ago
1998
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...