434 search results - page 30 / 87 » Improved Algorithms for the 2-Vertex Disjoint Paths Problem |
85
Voted
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
— Slow convergence in the Internet can be directly attributed to the “path exploration” phenomenon, inherent in all path vector protocols. The root cause for path exploration...
CCCG
2009
14 years 10 months ago
2009
We study a maximum flow problem in a polygonal domain P: Determine the maximum number of disjoint "thick" paths (of specified width w) through P from a source edge to a ...
AAIM
2010
Springer
15 years 25 days ago
2010
Springer
Given two genomic maps G and H represented by a sequence of n gene markers, a strip (syntenic block) is a sequence of distinct markers of length at least two which appear as subseq...
124
click to vote
DCG
2010
14 years 9 months ago
2010
We consider the well known geometric problem of determining shortest paths between pairs of points on a polyhedral surface P, where P consists of triangular faces with positive we...
DCOSS
2008
Springer
14 years 11 months ago
2008
Springer
Unlike traditional multihop forwarding among homogeneous static sensor nodes, use of mobile devices for data collection in wireless sensor networks has recently been gathering more...