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]](https://bibbase.org/img/filetypes/link.svg "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
{"_id":"vgW5SyBhT2RFHeECu","bibbaseid":"georgiadis-graf-italiano-parotsidis-uznanski-allpairs2reachabilityinonwlogntime-2017","author_short":["Georgiadis, L.","Graf, D.","Italiano, G. F.","Parotsidis, N.","Uznanski, P."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Loukas"],"propositions":[],"lastnames":["Georgiadis"],"suffixes":[]},{"firstnames":["Daniel"],"propositions":[],"lastnames":["Graf"],"suffixes":[]},{"firstnames":["Giuseppe","F."],"propositions":[],"lastnames":["Italiano"],"suffixes":[]},{"firstnames":["Nikos"],"propositions":[],"lastnames":["Parotsidis"],"suffixes":[]},{"firstnames":["Przemyslaw"],"propositions":[],"lastnames":["Uznanski"],"suffixes":[]}],"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":[{"firstnames":["Ioannis"],"propositions":[],"lastnames":["Chatzigiannakis"],"suffixes":[]},{"firstnames":["Piotr"],"propositions":[],"lastnames":["Indyk"],"suffixes":[]},{"firstnames":["Fabian"],"propositions":[],"lastnames":["Kuhn"],"suffixes":[]},{"firstnames":["Anca"],"propositions":[],"lastnames":["Muscholl"],"suffixes":[]}],"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","bibtex":"@INPROCEEDINGS{GeorgiadisGI2017IP,\n author = {Loukas Georgiadis and Daniel Graf and Giuseppe F. Italiano and Nikos\n\tParotsidis and Przemyslaw Uznanski},\n title = {{All-Pairs 2-Reachability in O(n^w log n) Time}},\n booktitle = {44th International Colloquium on Automata, Languages, and Programming\n\t(ICALP 2017)},\n year = {2017},\n editor = {Ioannis Chatzigiannakis and Piotr Indyk and Fabian Kuhn and Anca\n\tMuscholl},\n volume = {80},\n series = {Leibniz International Proceedings in Informatics (LIPIcs)},\n pages = {74:1--74:14},\n address = {Dagstuhl, Germany},\n publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},\n annote = {Keywords: 2-reachability, All Dominator Trees, Directed Graphs, Boolean\n\tMatrix Multiplication},\n doi = {10.4230/LIPIcs.ICALP.2017.74},\n isbn = {978-3-95977-041-5},\n issn = {1868-8969},\n url = {http://drops.dagstuhl.de/opus/volltexte/2017/7451},\n urn = {urn:nbn:de:0030-drops-74510}\n}\n\n","author_short":["Georgiadis, L.","Graf, D.","Italiano, G. F.","Parotsidis, N.","Uznanski, P."],"editor_short":["Chatzigiannakis, I.","Indyk, P.","Kuhn, F.","Muscholl, A."],"key":"GeorgiadisGI2017IP","id":"GeorgiadisGI2017IP","bibbaseid":"georgiadis-graf-italiano-parotsidis-uznanski-allpairs2reachabilityinonwlogntime-2017","role":"author","urls":{"Paper":"http://drops.dagstuhl.de/opus/volltexte/2017/7451"},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://polybox.ethz.ch/index.php/s/wa4X7mAfU4Cgo3p/download","dataSources":["R7QLFCx79AQPLx6QS"],"keywords":[],"search_terms":["pairs","reachability","log","time","georgiadis","graf","italiano","parotsidis","uznanski"],"title":"All-Pairs 2-Reachability in O(n^w log n) Time","year":2017}