5105 search results - page 156 / 1021 » An algorithm to determine peer-reviewers |
98
Voted
CIAC
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Given two rooted, labeled trees P and T the tree path subsequence problem is to determine which paths in P are subsequences of which paths in T. Here a path begins at the...
91
Voted
CORR
2010
Springer
15 years 25 days ago
2010
Springer
We show that there is a straightforward algorithm to determine if the polyhedron guaranteed to exist by Alexandrov's gluing theorem is a degenerate flat polyhedron, and to re...
80
Voted
DAM
2007
15 years 21 days ago
2007
We study a many-to-many generalisation of the well-known stable roommates problem in which each participant seeks to be matched with a number of others. We present a linear-time a...
94
Voted
DM
2007
15 years 21 days ago
2007
We present an algorithm that determines the prime factors of connected graphs with respect to the Cartesian product in linear time and space. This improves a result of Aurenhammee...
81
Voted
CORR
2000
Springer
15 years 16 days ago
2000
Springer
The weak limit of the normalized number of comparisons needed by the Quicksort algorithm to sort n randomly permuted items is known to be determined implicitly by a distributional...