All-Pairs 2-Reachability in O(n^w log n) Time. Georgiadis, L., Graf, D., Italiano, G. F., Parotsidis, N., & Uznanski, P. In Chatzigiannakis, I., Indyk, P., Kuhn, F., & Muscholl, A., editors, 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), volume 80, of Leibniz International Proceedings in Informatics (LIPIcs), pages 74:1–74:14, Dagstuhl, Germany, 2017. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
All-Pairs 2-Reachability in O(n^w log n) Time [link]Paper  doi  bibtex   
@INPROCEEDINGS{GeorgiadisGI2017IP,
  author = {Loukas Georgiadis and Daniel Graf and Giuseppe F. Italiano and Nikos
	Parotsidis and Przemyslaw Uznanski},
  title = {{All-Pairs 2-Reachability in O(n^w log n) Time}},
  booktitle = {44th International Colloquium on Automata, Languages, and Programming
	(ICALP 2017)},
  year = {2017},
  editor = {Ioannis Chatzigiannakis and Piotr Indyk and Fabian Kuhn and Anca
	Muscholl},
  volume = {80},
  series = {Leibniz International Proceedings in Informatics (LIPIcs)},
  pages = {74:1--74:14},
  address = {Dagstuhl, Germany},
  publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  annote = {Keywords: 2-reachability, All Dominator Trees, Directed Graphs, Boolean
	Matrix Multiplication},
  doi = {10.4230/LIPIcs.ICALP.2017.74},
  isbn = {978-3-95977-041-5},
  issn = {1868-8969},
  url = {http://drops.dagstuhl.de/opus/volltexte/2017/7451},
  urn = {urn:nbn:de:0030-drops-74510}
}

Downloads: 0