Go to the corresponding LIPIcs Volume Portal 
Preißer, Johanna E. ; Schmidt, Jens M.
pdfformat: 

@InProceedings{preier_et_al:LIPIcs:2018:9961, author = {Johanna E. Prei{\ss}er and Jens M. Schmidt}, title = {{Computing VertexDisjoint Paths in Large Graphs Using MAOs}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {13:113:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770941}, ISSN = {18688969}, year = {2018}, volume = {123}, editor = {WenLian Hsu and DerTsai Lee and ChungShou Liao}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9961}, URN = {urn:nbn:de:0030drops99613}, doi = {10.4230/LIPIcs.ISAAC.2018.13}, annote = {Keywords: Computing Disjoint Paths, Large Graphs, VertexConnectivity, LinearTime, Maximal Adjacency Ordering, Maximum Cardinality Search, Big Data, Certifying} }
Keywords:  Computing Disjoint Paths, Large Graphs, VertexConnectivity, LinearTime, Maximal Adjacency Ordering, Maximum Cardinality Search, Big Data, Certifying  
Seminar:  29th International Symposium on Algorithms and Computation (ISAAC 2018)  
Issue Date:  2018  
Date of publication:  27.11.2018 