Finding a path of superlogarithmic length
Författare
Summary, in English
Avdelning/ar
- Institutionen för datavetenskap
- Computer Science
- Parallella System
Publiceringsår
2002
Språk
Engelska
Sidor
985-992
Publikation/Tidskrift/Serie
Automata, languages and programming : 29th international colloquium, ICALP 2002, Málaga, Spain, July 8-13, 2002 : proceedings
Volym
LNCS 2380
Fulltext
- Available as PDF - 217 kB
- Download statistics
Länkar
Dokumenttyp
Konferensbidrag
Förlag
Springer
Ämne
- Computer Science
Nyckelord
- computational complexity
- graph theory
- superlogarithmic length path finding
- undirected graph
- polynomial-time algorithm
- performance ratio
- graph vertices
- longest path problem
Conference name
Proceedings of 29th International Colloquium on Automata, Languages and Programming
Conference date
2002-07-08 - 2002-07-13
Conference place
Malaga, Spain
Status
Published
ISBN/ISSN/Övrigt
- ISBN: 3540438645