pdf-format: |
|
@InProceedings{grohe_et_al:LIPIcs:2018:9071, author = {Martin Grohe and Daniel Neuen and Pascal Schweitzer and Daniel Wiebking}, title = {{An Improved Isomorphism Test for Bounded-Tree-Width Graphs}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {67:1--67:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Ioannis Chatzigiannakis and Christos Kaklamanis and D{\'a}niel Marx and Donald Sannella}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9071}, URN = {urn:nbn:de:0030-drops-90714}, doi = {10.4230/LIPIcs.ICALP.2018.67}, annote = {Keywords: graph isomorphism, graph canonization, tree width, decompositions} }
Keywords: | graph isomorphism, graph canonization, tree width, decompositions | |
Seminar: | 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) | |
Issue date: | 2018 | |
Date of publication: | 04.07.2018 |