Search Sciweavers | Sciweavers

162 search results - page 2 / 33

» The Induced Disjoint Paths Problem

click to vote

MOR
2000

162views more MOR 2000»

Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems

13 years 5 months ago

Download www.cs.umd.edu

Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...

Alok Baveja, Aravind Srinivasan

claim paper

Read More »

click to vote

SODA
2010
ACM

278views Algorithms» more SODA 2010»

The edge disjoint paths problem in Eulerian graphs and $4$-edge-connected graphs

14 years 3 months ago

Download siam.org

We consider the following well-known problem, which is called the edge-disjoint paths problem. Input: A graph G with n vertices and m edges, k pairs of vertices (s1, t1), (s2, t2)...

Ken-ichi Kawarabayashi, Yusuke Kobayashi

claim paper

Read More »

click to vote

SOFSEM
2009
Springer

100views Theoretical Computer Science» more SOFSEM 2009»

Improved Algorithms for the 2-Vertex Disjoint Paths Problem

14 years 2 months ago

Download www.sofsem.cz

Torsten Tholey

claim paper

Read More »