1447 search results - page 27 / 290 » Graphs and Path Equilibria |
ICCS
2007
Springer
14 years 1 months ago
2007
Springer
1 A graph G is hamiltonian-connected if any two of its vertices are connected by a Hamilton2 path (a path including every vertex of G); and G is s-hamiltonian-connected if the del...
DC
2002
13 years 9 months ago
2002
A new general theory about restoration of network paths is first introduced. The theory pertains to restoration of shortest paths in a network following failure, e.g., we prove th...
SLS
2009
Springer
14 years 4 months ago
2009
Springer
Ant Colony Optimization (ACO) is inspired by the ability of ant colonies to find shortest paths between their nest and a food source. We analyze the running time of different ACO...
COMPGEOM
2000
ACM
14 years 2 months ago
2000
ACM
The algorithms for computing a shortest path on a polyhedral surface are slow, complicated, and numerically unstable. We have developed and implemented a robust and efficient algo...
IPL
2010
13 years 8 months ago
2010
We show that the problem of computing a minimum distortion embedding of a given graph into a path remains NP-hard when the input graph is restricted to a bipartite, cobipartite, o...