Go to the corresponding LIPIcs Volume Portal |
Bousquet, Nicolas ; Ito, Takehiro ; Kobayashi, Yusuke ; Mizuta, Haruka ; Ouvrard, Paul ; Suzuki, Akira ; Wasa, Kunihiro
pdf-format: |
|
@InProceedings{bousquet_et_al:LIPIcs.STACS.2022.15, author = {Bousquet, Nicolas and Ito, Takehiro and Kobayashi, Yusuke and Mizuta, Haruka and Ouvrard, Paul and Suzuki, Akira and Wasa, Kunihiro}, title = {{Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {15:1--15:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra and Monmege, Benjamin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2022/15825}, URN = {urn:nbn:de:0030-drops-158253}, doi = {10.4230/LIPIcs.STACS.2022.15}, annote = {Keywords: combinatorial reconfiguration, spanning trees, PSPACE, polynomial-time algorithms} }
Keywords: | combinatorial reconfiguration, spanning trees, PSPACE, polynomial-time algorithms | |
Collection: | 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022) | |
Issue Date: | 2022 | |
Date of publication: | 09.03.2022 |