"Finding least common ancestors in directed acyclic graphs."

Michael A. Bender et al. (2001)

> Home

Details and statistics

DOI: —

access: closed

type: Conference or Workshop Paper

metadata version: 2012-12-07

- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/soda/BenderPSS01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/BenderPSS01
Michael A. Bender, Giridhar Pemmasani, Steven Skiena, Pavel Sumazin:
Finding least common ancestors in directed acyclic graphs. SODA 2001: 845-854

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.