A path cover technique for LCAs in dags
Author
Editor
- Joachim Gudmundsson
Summary, in English
Finally, we apply our technique to improve the general upper time bounds on the worst case time complexity for the problem of reporting LCAs for each triple of vertices recently established by Yuster[26].
Department/s
- Computer Science
Publishing year
2008
Language
English
Pages
222-223
Publication/Series
Algorithm theory – SWAT 2008 / Lecture notes in computer science
Volume
5124
Document type
Conference paper
Publisher
Springer
Topic
- Computer Science
Conference name
11th Scandinavian workshop on algorithm theory
Conference date
2008-07-02 - 2008-07-04
Conference place
Gothenburg, Sweden
Status
Published
Project
- VR 2005-4085
ISBN/ISSN/Other
- ISSN: 1611-3349
- ISSN: 0302-9743
- ISBN: 978-3-540-69900-2