scientific article
From MaRDI portal
Publication:3113669
DOI10.4230/LIPIcs.STACS.2011.12zbMath1230.68157MaRDI QIDQ3113669
Georg Gottlob, Markus Aschinger, Conrad Drescher, Evgenij Thorstensen, Peter G. Jeavons
Publication date: 23 January 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_a516.html
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) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items
Structural decompositions for problems with global constraints, The complexity of minimum-length path decompositions, On tradeoffs between width- and fill-like graph parameters, Multi-path algorithms for minimum-colour path problems with applications to approximating barrier resilience, Using decomposition-parameters for QBF: mind the prefix!