Results 41 to 50 of about 1,116,280 (113)
Neutrosophic Shortest Path Problem [PDF]
, 2018 Neutrosophic set theory provides a new tool to handle the uncertainties in shortest path problem (SPP). This paper introduces the SPP from a source node to a destination node on a neutrosophic graph in which a positive neutrosophic number is assigned to ...
Arindam Dey (5158523) +13 more
core +2 more sources
Heuristic estimates in shortest path algorithms [PDF]
Shortest path problems occupy an important position in Operations Research aswell as in Arti¯cial Intelligence. In this paper we study shortest path algorithms thatexploit heuristic estimates. The well-known algorithms are put into one framework.Besides
Pijls, W.H.L.M.
core
An oblivious shortest-path routing algorithm for fully connected cubic networks
, 2006 Fully connected cubic networks (FCCNs) are a class of newly proposed hierarchical interconnection networks for multicomputer systems, which enjoy the strengths of constant node degree and good expandability.
Yang, X. +3 more
core +1 more source
Core and Bargaining Set of Shortest Path Games [PDF]
In this paper it is shown that the core and the bargaining sets of Davis-Maschler and Zhou coincide in a class of shortest path games.Shortest path games; core; bargaining ...
Grahn, Sofia
core
An Auction Algorithm for Shortest Paths [PDF]
SIAM Journal on Optimization, 1991 Summary: A new and simple algorithm for finding shortest paths in a directed graph is proposed. In the single origin-single destination case, the algorithm maintains a single path starting at the origin, which is extended or contracted by a single node at each iteration.
openaire +3 more sources
Secluded Path via Shortest Path [PDF]
, 2014 We provide several new algorithmic results for the secluded path problem, specifically approximation and optimality results for the static algorithm of [3,5], and an extension (h-Memory) of it based on de Bruijn graphs, when applied to bounded degree graphs and some other special graph classes which can model wireless communication and line-of-sight ...
Matthew P. Johnson 0001 +2 more
openaire +2 more sources
K shortest paths in stochastic time-dependent networks [PDF]
A substantial amount of research has been devoted to the shortest path problem in networks where travel times are stochastic or (deterministic and) time-dependent.
Andersen, Kim Allan +2 more
core
Five validated genes identified by the shortest-path-based method.
, 2016 Five validated genes identified by the shortest-path-based method.
Liucun Zhu (3150894) +5 more
core +1 more source
Stochastic shortest path algorithm based on Lagrangian relaxation [PDF]
, 2010 In VLSI circuit design, graph algorithms are widely used and graph structure can model many problems. As technology continues to scale into nanometer design, the effects of process variation become more crucial and design parameters also change.
Hwang, Leslie K.
core
Six candidate genes identified by the shortest-path-based method.
, 2016 Six candidate genes identified by the shortest-path-based method.
Liucun Zhu (3150894) +5 more
core +1 more source