LCA Queries in Directed Acyclic Graphs

@inproceedings{Kowaluk2005LCAQI,
  title={LCA Queries in Directed Acyclic Graphs},
  author={Miroslaw Kowaluk and Andrzej Lingas},
  booktitle={ICALP},
  year={2005}
}
We present two 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 surprisingly natural and solves the all-pairs LCA problem for the input dag on n vertices and m edges in time O(nm). As a corollary, we obtain an O(n)-time algorithm for finding genealogical distances considerably improving the previously known O(n) timebound for this problem. The second method relies on a novel reduction of… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 21 extracted citations

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Witnesses for Boolean Matrix Multiplication and Construction of Perfect hash functions

G. Pemmasani
Finding Least Common Ancestors in Directed Acyclic Graphs . Proc . the 12 th Annual ACMSIAM Symposium on Discrete Algorithms ( SODA ) • 1996

Genetic linkage computations

R. M. Idury, A. A. Shäffer
American Journal of Human Genetics • 1993

Shäffer. Genetic linkage computations

R. W. Cottingham, R. M. Idury, A.A
American Journal of Human Genetics, • 1993
View 1 Excerpt

Similar Papers

Loading similar papers…