Go to the corresponding LIPIcs Volume Portal 
Duan, Ran ; Gu, Yong ; Zhang, Le
pdfformat: 

@InProceedings{duan_et_al:LIPIcs:2018:9048, author = {Ran Duan and Yong Gu and Le Zhang}, title = {{Improved Time Bounds for All Pairs Nondecreasing Paths in General Digraphs}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {44:144:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770767}, ISSN = {18688969}, year = {2018}, volume = {107}, editor = {Ioannis Chatzigiannakis and Christos Kaklamanis and D{\'a}niel Marx and Donald Sannella}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9048}, URN = {urn:nbn:de:0030drops90487}, doi = {10.4230/LIPIcs.ICALP.2018.44}, annote = {Keywords: Graph algorithms, Matrix multiplication, Nondecreasing paths} }
Keywords:  Graph algorithms, Matrix multiplication, Nondecreasing paths  
Collection:  45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)  
Issue Date:  2018  
Date of publication:  04.07.2018 