1986 search results - page 43 / 398 » Path Separability of Graphs |
IPL
2008
13 years 8 months ago
2008
In this paper, we prove polynomial running time bounds for an Ant Colony Optimization (ACO) algorithm for the single-destination shortest path problem on directed acyclic graphs. ...
ECCC
2007
13 years 8 months ago
2007
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...
SMC
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract--Finding the longest simple path in a generic undirected graph is a challenging issue that belongs to the NPComplete class of problems. Four approaches based on genetic al...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. Let G be a directed planar graph of complexity n, each arc having a nonnegative length. Let s and t be two distinct faces of G; let s1, . . . , sk be vertices incident wi...
ALGORITHMICA
2011
13 years 3 months ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...