@inproceedings{a503c905dbed490a8de2106f0ce8ae3b,

title = "Finding a path of superlogarithmic length",

abstract = "We consider the problem of nding a long, simple path in anundirected graph.W e present a polynomial-time algorithm that ndsa path of length (log L/ log log L)2, where L denotes the length ofthe longest simple path in the graph.This establishes the performanceratio O|V |(log log |V |/ log |V |)2 for the Longest Path problem, whereV denotes the graphs vertices.",

keywords = "computational complexity, graph theory, superlogarithmic length path finding, undirected graph, polynomial-time algorithm, performance ratio, graph vertices, longest path problem",

author = "Andreas Bj{\"o}rklund and Thore Husfeldt",

year = "2002",

language = "English",

isbn = "3540438645",

volume = "LNCS 2380",

publisher = "Springer",

pages = "985--992",

booktitle = "Automata, languages and programming : 29th international colloquium, ICALP 2002, M{\'a}laga, Spain, July 8-13, 2002 : proceedings",

address = "Germany",

note = "Proceedings of 29th International Colloquium on Automata, Languages and Programming ; Conference date: 08-07-2002 Through 13-07-2002",

}