For a weighted, undirected graph G = V;E where jVj = n and jEj = m, we examine the single most vital edge with respect to two measurements related to all-pairs shortest paths APSP....
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
Christopher L. Barrett, Riko Jacob, Madhav V. Mara...
We study the multi-constrained Quality-of-Service (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K 2 additive end-to-end Qo...
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
Abstract. We consider the problem of aligning two metabolic pathways. Unlike traditional approaches, we do not restrict the alignment to one-to-one mappings between the molecules o...