pdfformat: 

@InProceedings{duan_et_al:LIPIcs:2019:10624, author = {Ran Duan and Ce Jin and Hongxun Wu}, title = {{Faster Algorithms for All Pairs NonDecreasing Paths Problem}}, booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)}, pages = {48:148:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771092}, ISSN = {18688969}, year = {2019}, volume = {132}, editor = {Christel Baier and Ioannis Chatzigiannakis and Paola Flocchini and Stefano Leonardi}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2019/10624}, URN = {urn:nbn:de:0030drops106241}, doi = {10.4230/LIPIcs.ICALP.2019.48}, annote = {Keywords: graph optimization, matrix multiplication, nondecreasing paths} }
Keywords:  graph optimization, matrix multiplication, nondecreasing paths  
Seminar:  46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)  
Issue date:  2019  
Date of publication:  04.07.2019 