Sciweavers

2796 search results - page 3 / 560
» The coolest path problem
Sort
View
MFCS
2009
Springer
14 years 23 days ago
The Longest Path Problem Is Polynomial on Interval Graphs
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
Kyriaki Ioannidou, George B. Mertzios, Stavros D. ...
TON
2002
91views more  TON 2002»
13 years 5 months ago
The stable paths problem and interdomain routing
Abstract-Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the Shortest Paths Problem. The Border Gateway Protocol (BGP) is cu...
Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilf...
TAMC
2009
Springer
14 years 23 days ago
A Simple Greedy Algorithm for the k-Disjoint Flow Problem
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
Maren Martens

Publication
2630views
15 years 5 months ago
DIJKSTRA’S and Fast Marching Method for Optimal Path Planning
This technical report illustrates the differences in solving the optimal path problem (shortest path) using different methods, where the underlying PDE can be described by the eik...
RYO TAKEI
DAM
1999
81views more  DAM 1999»
13 years 5 months ago
On the Complexity of Hamiltonian Path and Cycle Problems in Certain Classes of Digraphs
We survey results on the sequential and parallel complexity of hamiltonian path and cycle problems in various classes of digraphs which generalize tournaments. We give detailed in...
Jørgen Bang-Jensen, Gregory Gutin