Sciweavers

19 search results - page 2 / 4
» algorithmica 2000
Sort
View
ALGORITHMICA
2000
77views more  ALGORITHMICA 2000»
14 years 10 months ago
Finding Edge-Disjoint Paths in Partial k-Trees
Xiao Zhou, Syurei Tamura, Takao Nishizeki
67
Voted
ALGORITHMICA
2000
87views more  ALGORITHMICA 2000»
14 years 10 months ago
Parts Feeding on a Conveyor with a One Joint Robot
This paper explores a method of manipulating a planar rigid part on a conveyor belt using a robot with just one joint. This approach has the potential of offering a simple and fle...
Srinivas Akella, Wesley H. Huang, Kevin M. Lynch, ...
ALGORITHMICA
2000
85views more  ALGORITHMICA 2000»
14 years 10 months ago
An Algorithm for Enumerating All Spanning Trees of a Directed Graph
We present an O(NV +V 3) time algorithm for enumerating all spanning trees of a directed graph. This improves the previous best known bound of O(NE + V + E) [1] when V 2 = o(N), wh...
Sanjiv Kapoor, H. Ramesh
61
Voted
ALGORITHMICA
2000
65views more  ALGORITHMICA 2000»
14 years 10 months ago
A Simultaneous Search Problem
We introduce a new search problem motivated by computational metrology. The problem is as follows: we would like to locate two unknown numbers x, y [0, 1] with as little uncertain...
Ee-Chien Chang, Chee-Keng Yap
128
Voted
ALGORITHMICA
2011
14 years 5 months ago
Common Intervals of Multiple Permutations
Abstract Given k permutations of n elements, a k-tuple of intervals of these permutations consisting of the same set of elements is called a common interval. We present an algorith...
Steffen Heber, Richard Mayr, Jens Stoye