Let PG(s, t) denote a shortest path between two nodes s and t in an undirected graph G with nonnegative edge weights. A detour at a node u ∈ PG(s, t) = (s, . . . , u, v, . . . , t) is defined as a shortest path PG−e(u, t) from u to t which does not make use of (u, v). In this paper, we focus on the problem of finding an edge e = (u, v) ∈ PG(s, t) whose removal produces a detour at node u such t...

Given a weighted directed network G, we consider the problem of computing k balanced paths from given source nodes to given destination nodes of G, i.e. k paths such that the difference in cost between the longest and the shortest path is minimized. The special case in which G is an acyclic network was theoretically investigated in [3]. It was proved that, in such a special case, the balanced p...

Weighted pushdown automata (WPDAs) have recently been adopted in some applications such as machine translation [Iglesias et al., 2011] as a more compact alternative to weighted finite-state automata (WFSAs) for representing a weighted set of strings. Allauzen and Riley [2012] introduce a set of basic algorithms for construction and inference of WPDAs, and the corresponding implementation as an ...

The shortest path problem is common in many different fields (transportation systems, mechanical systems, etc). Most of the telecommunication industry protocols such as PNNI, OSPF and IISP use Dijkstra’s algorithm or Bellman-Ford’s algorithm to solve the shortest path problem. Today, the majority of the shortest path computations are performed in software, which is inefficient for real-time app...

in this article we present an algorithm for converting a network problem with several sources and several sinks including several transfer nodes and condition of supplying the demand of any sink from a particular source to the transportation problem.  towards this end, and considering the very special structure of transportation algorithm, after implementing the shortest path algorithm or solvi...

In this paper, we survey algorithms for shortest paths in dynamic networks. Although research on this problem spans over more than three decades, in the last couple of years many novel algorithmic techniques have been proposed. In this survey, we will make a special effort to abstract some combinatorial and algebraic properties, and some common data-structural tools that are at the base of thos...