Results 31 to 40 of about 1,116,280 (113)
Computer simulations of path generation and path form modification with rules working on a parallel cell-based architecture [PDF]
, 1994 Dautenhahn K, Cruse H. Computer simulations of path generation and path form modification with rules working on a parallel cell-based architecture. Computers Math. Applic.
Dautenhahn, Kerstin +3 more
core +1 more source
Optimal Allocation of Protective Resources in Shortest-Path Networks [PDF]
, 2008 We develop a game theoretic approach for allocating protection resources among the components of a network so as to maximize its robustness to external disruptions.
Cappanera, Paola, Scaparra, Maria Paola
core
The Discrepancy of Shortest Paths
CoRRThe hereditary discrepancy of a set system is a certain quantitative measure of the pseudorandom properties of the system. Roughly, hereditary discrepancy measures how well one can $2$-color the elements of the system so that each set contains approximately the same number of elements of each color.
Greg Bodwin +5 more
openaire +6 more sources
The complexity of rerouting shortest paths [PDF]
Theoretical Computer Science, 2012 The results on claw-free graphs, chordal graphs and isolated paths have been added in version 2 (april 2012). Version 1 (September 2010) only contained the PSPACE-hardness result. (Version 2 has been submitted.)
openaire +3 more sources
An investigation of shortest paths algorithms [PDF]
, 1987 In this work, we classify the shortest path problems, review all source algorithms and analyse the different implementations of single source algorithms using various list structures and labelling techniques.
Tabatabai, Bijan Oni, Tabatabai, B.O
core
Engineering Shortest Path Algorithms [PDF]
, 2004 In this paper, we report on our own experience in studying a fundamental problem on graphs: all pairs shortest paths. In particular, we discuss the interplay between theory and practice in engineering a simple variant of Dijkstra’s shortest path algorithm.
DEMETRESCU, Camil, Giuseppe F. Italiano
openaire +3 more sources
Critical review of time-dependent shortest path algorithms: A multimodal trip planner perspective [PDF]
, 2014 A multimodal trip planner that produces optimal journeys involving both public transport and private vehicle legs has to solve a number of shortest path problems, both on the road network and the public transport network.
Casey, Bradley +3 more
core +1 more source
The Shapley value for shortest path games [PDF]
, 2011 In this paper shortest path games are considered. The transportation of a good in a network has costs and benet too. The problem is to divide the prot of the transportation among the players.
Radványi, Anna, Pintér, Miklós
core +2 more sources
Shortest-Path Reconstruction Algorithms [PDF]
The Computer Journal, 1993 Summary: We study the problem of computing shortest paths between pairs of vertices in an \(n\)-vertex graph, given only the all pairs shortest paths distance matrix. This computation is called a reconstruction, since the algorithm has no access to explicit information about edges in the original graph. We present the following results: 1.
openaire +2 more sources
How good (or bad) is shortest path routing in layered networks
, 2012 Shortest path routing is used throughout the Internet. If link costs accurately reflect real costs of installation and maintenance, and the total network cost is accurately modelled as the sum of link costs, shortest path routing can be expected to ...
Li, Fan +9 more
core +1 more source