4 search results - page 1 / 1 » Output-Sensitive Reporting of Disjoint Paths |
ALGORITHMICA
1999
13 years 6 months ago
1999
ICALP
2010
Springer
13 years 10 months ago
2010
Springer
We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
TON
2010
13 years 29 days ago
2010
Abstract--In communication networks, multiple disjoint communication paths are desirable for many applications. Such paths, however, may not exist in a network. In such a situation...
ICCV
2003
IEEE
13 years 11 months ago
2003
IEEE
Conventional tracking approaches assume proximity in space, time and appearance of objects in successive observations. However, observations of objects are often widely separated ...