Computing Lowest Common Ancestors in Directed Acyclic Graphs

Yijie Han. Computing Lowest Common Ancestors in Directed Acyclic Graphs. In Bidyut Gupta, editor, 22nd International Conference on Computers and Their Applications, CATA-2007, Honolulu, Hawaii, USA, March 28-30, 2007. pages 36-37, ISCA, 2007.

@inproceedings{Han07:13,
  title = {Computing Lowest Common Ancestors in Directed Acyclic Graphs},
  author = {Yijie Han},
  year = {2007},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Han07%3A13},
  cites = {0},
  citedby = {0},
  pages = {36-37},
  booktitle = {22nd International Conference on Computers and Their Applications, CATA-2007, Honolulu, Hawaii, USA, March 28-30, 2007},
  editor = {Bidyut Gupta},
  publisher = {ISCA},
  isbn = {978-1-880843-62-8},
}