Intl. Colloquium on Automata, Languages, and Programming, ICALP 2017


Article Details
Title: All-Pairs 2-Reachability in O(n^w log n) Time
Article URLs:
Alternative Article URLs:
Authors: Loukas Georgiadis
  • University of Ioannina
Daniel Graf
  • ETH Zürich, Department of Computer Science
Giuseppe F. Italiano
  • University of Rome Tor Vergata
Nikos Parotsidis
  • University of Rome Tor Vergata
Przemyslaw Uznanski
  • ETH Zürich, Department of Computer Science
Sharing: Research produced no artifacts
Verification: Authors have verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/icalp/GeorgiadisGIPU17
Author Comments:

Discuss this paper and its artifacts below