Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Cut and Count and representative sets on branch decompositions - MaRDI portal

Cut and Count and representative sets on branch decompositions

From MaRDI portal

Publication:4634412

Jump to:navigation, search

DOI10.4230/LIPIcs.IPEC.2016.27zbMath1398.05205OpenAlexW2514415970MaRDI QIDQ4634412

Johan M. M. van Rooij, Willem J. A. Pino, Hans L. Bodlaender

Publication date: 10 April 2018

Full work available at URL: https://doi.org/10.4230/LIPIcs.IPEC.2016.27

zbMATH Keywords

dynamic programming planar graphs treewidth graph algorithms branchwidth

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)

Related Items (3)

On the Exact Complexity of Hamiltonian Cycle and q-Colouring in Disk Graphs ⋮ Fast Algorithms for Join Operations on Tree Decompositions ⋮ Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space

This page was built for publication: Cut and Count and representative sets on branch decompositions

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4634412&oldid=18811755"