All-Pairs 2-Reachability in O(n^w log n) Time

Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Nikos Parotsidis, Przemyslaw Uznanski. All-Pairs 2-Reachability in O(n^w log n) Time. In Ioannis Chatzigiannakis, Piotr Indyk, Fabian Kuhn, Anca Muscholl, editors, 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland. Volume 80 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. [doi]

Authors

Loukas Georgiadis

This author has not been identified. Look up 'Loukas Georgiadis' in Google

Daniel Graf

This author has not been identified. Look up 'Daniel Graf' in Google

Giuseppe F. Italiano

This author has not been identified. Look up 'Giuseppe F. Italiano' in Google

Nikos Parotsidis

This author has not been identified. Look up 'Nikos Parotsidis' in Google

Przemyslaw Uznanski

This author has not been identified. Look up 'Przemyslaw Uznanski' in Google