1200 search results - page 1 / 240 » Marked Ancestor Problems |
FOCS
1998
IEEE
13 years 9 months ago
1998
IEEE
IPL
2010
13 years 3 months ago
2010
We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...
ECCC
2006
13 years 4 months ago
2006
We present two new methods for finding a lowest common ancestor (LCA) for each pair of vertices of a directed acyclic graph (dag) on n vertices and m edges. The first method is su...
LATIN
2000
Springer
13 years 8 months ago
2000
Springer
We present a very simple algorithm for the Least Common Ancestor problem. We thus dispel the frequently held notion that an optimal LCA computation is unwieldy and unimplementable...
HPCC
2005
Springer
13 years 10 months ago
2005
Springer
Hierarchical clustering methods are important in many data mining and pattern recognition tasks. In this paper we present an efficient coarse grained parallel algorithm for Single...