632 search results - page 5 / 127 » On Routing in Circulant Graphs |
CMA
2010
13 years 4 months ago
2010
CMA
2011
12 years 11 months ago
2011
EOR
2006
13 years 7 months ago
2006
This paper addresses the railway rolling stock circulation problem. Given the departure and arrival times as well as the expected numbers of passengers, we have to assign the roll...
INFOCOM
2012
IEEE
11 years 9 months ago
2012
IEEE
—This paper focuses on the Internet IP-level routing topology and proposes relevant explanations to its apparent dynamics. We first represent this topology as a power-law random...
TC
1998
13 years 7 months ago
1998
—Loop networks (or Hamiltonian circulant graphs) are a popular class of fault-tolerant network topologies which include rings and complete graphs. For this class, the fundamental...