Go to the corresponding LIPIcs Volume Portal 
Erlebach, Thomas ; Spooner, Jakob T.
pdfformat: 

@InProceedings{erlebach_et_al:LIPIcs:2018:9618, author = {Thomas Erlebach and Jakob T. Spooner}, title = {{Faster Exploration of DegreeBounded Temporal Graphs}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {36:136:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770866}, ISSN = {18688969}, year = {2018}, volume = {117}, editor = {Igor Potapov and Paul Spirakis and James Worrell}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9618}, URN = {urn:nbn:de:0030drops96181}, doi = {10.4230/LIPIcs.MFCS.2018.36}, annote = {Keywords: temporal graph exploration, algorithmic graph theory, NPcomplete problem} }
Keywords:  temporal graph exploration, algorithmic graph theory, NPcomplete problem  
Seminar:  43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)  
Issue Date:  2018  
Date of publication:  20.08.2018 