pdf-format: |
|
@InProceedings{holm_et_al:LIPIcs:2017:7875, author = {Jacob Holm and Giuseppe F. Italiano and Adam Karczmarz and Jakub Lacki and Eva Rotenberg and Piotr Sankowski}, title = {{Contracting a Planar Graph Efficiently}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {50:1--50:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Kirk Pruhs and Christian Sohler}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7875}, URN = {urn:nbn:de:0030-drops-78755}, doi = {10.4230/LIPIcs.ESA.2017.50}, annote = {Keywords: planar graphs, algorithms, data structures, connectivity, coloring} }
Keywords: | planar graphs, algorithms, data structures, connectivity, coloring | |
Seminar: | 25th Annual European Symposium on Algorithms (ESA 2017) | |
Issue date: | 2017 | |
Date of publication: | 01.09.2017 |