Faster Algorithms on Branch and Clique Decompositions
From MaRDI portal
Publication:3586082
DOI10.1007/978-3-642-15155-2_17zbMath1287.05147OpenAlexW1491209906WikidataQ59567670 ScholiaQ59567670MaRDI QIDQ3586082
Erik Jan van Leeuwen, Martin Vatshelle, Johan M. M. van Rooij, Hans L. Bodlaender
Publication date: 3 September 2010
Published in: Mathematical Foundations of Computer Science 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15155-2_17
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Fast Algorithms for Join Operations on Tree Decompositions ⋮ Fixed-Parameter Tractability of Treewidth and Pathwidth ⋮ New analysis and computational study for the planar connected dominating set problem ⋮ Maximum matching width: new characterizations and a fast algorithm for dominating set ⋮ Structural parameters, tight bounds, and approximation for \((k, r)\)-center ⋮ Parameterized complexity of generalized domination problems ⋮ Unnamed Item ⋮ Finer Tight Bounds for Coloring on Clique-Width ⋮ Faster algorithms for vertex partitioning problems parameterized by clique-width ⋮ Boolean-width of graphs ⋮ Unnamed Item ⋮ Structurally parameterized \(d\)-scattered set ⋮ Unnamed Item
