Bisection of bounded treewidth graphs by convolutions
From MaRDI portal
Publication:2662673
DOI10.1016/j.jcss.2021.02.002zbMath1477.68220MaRDI QIDQ2662673
Daniel Lokshtanov, Amer E. Mouawad, Eduard Eiben
Publication date: 14 April 2021
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2019/11163/
68Q25: Analysis of algorithms and problem complexity
68W40: Analysis of algorithms
68R10: Graph theory (including graph drawing) in computer science