Go to the corresponding LIPIcs Volume Portal 
Georgiadis, Loukas ; Graf, Daniel ; Italiano, Giuseppe F. ; Parotsidis, Nikos ; Uznanski, Przemyslaw
pdfformat: 

@InProceedings{georgiadis_et_al:LIPIcs:2017:7451, author = {Loukas Georgiadis and Daniel Graf and Giuseppe F. Italiano and Nikos Parotsidis and Przemyslaw Uznanski}, title = {{AllPairs 2Reachability in O(n^w log n) Time}}, booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)}, pages = {74:174:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770415}, ISSN = {18688969}, year = {2017}, volume = {80}, editor = {Ioannis Chatzigiannakis and Piotr Indyk and Fabian Kuhn and Anca Muscholl}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7451}, URN = {urn:nbn:de:0030drops74510}, doi = {10.4230/LIPIcs.ICALP.2017.74}, annote = {Keywords: 2reachability, All Dominator Trees, Directed Graphs, Boolean Matrix Multiplication} }
Keywords:  2reachability, All Dominator Trees, Directed Graphs, Boolean Matrix Multiplication  
Seminar:  44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)  
Issue Date:  2017  
Date of publication:  06.07.2017 