Complexity of independency and cliquy trees
From MaRDI portal
Publication:2283099
DOI10.1016/j.dam.2018.08.011zbMath1429.05036WikidataQ59864851 ScholiaQ59864851MaRDI QIDQ2283099
Henning Fernau, Erik Jan van Leeuwen, Markus L. Schmid, Fernando Sánchez Villaamil, Katrin Casel, Jan Dreier, Moritz Gobbert, Philipp Kuinke
Publication date: 30 December 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.08.011
parameterized complexity; exact algorithms; kernelization algorithms; independency tree; cliquy tree
68Q25: Analysis of algorithms and problem complexity
05C05: Trees
05C85: Graph algorithms (graph-theoretic aspects)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)