pdf-format: |
|
@InProceedings{jain_et_al:LIPIcs:2019:11508, author = {Rahul Jain and Raghunath Tewari}, title = {{Reachability in High Treewidth Graphs}}, booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)}, pages = {12:1--12:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-130-6}, ISSN = {1868-8969}, year = {2019}, volume = {149}, editor = {Pinyan Lu and Guochuan Zhang}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2019/11508}, URN = {urn:nbn:de:0030-drops-115087}, doi = {10.4230/LIPIcs.ISAAC.2019.12}, annote = {Keywords: graph reachability, simultaneous time-space upper bound, tree decomposition} }
Keywords: | graph reachability, simultaneous time-space upper bound, tree decomposition | |
Seminar: | 30th International Symposium on Algorithms and Computation (ISAAC 2019) | |
Issue date: | 2019 | |
Date of publication: | 28.11.2019 |