scientific article; zbMATH DE number 6862108
From MaRDI portal
Publication:4636614
DOI10.4230/LIPIcs.STACS.2017.16zbMath1390.68334arXiv1607.07676MaRDI QIDQ4636614
Édouard Bonnet, Paweł Rzążewski, Tillmann Miltzow
Publication date: 19 April 2018
Full work available at URL: https://arxiv.org/abs/1607.07676
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
Swapping colored tokens on graphs ⋮ Complexity of token swapping and its variants ⋮ Introduction to reconfiguration
This page was built for publication:
