Complexity of independency and cliquy trees
type: Item
instance of: scholarly article
title: Complexity of independency and cliquy trees
zbMATH Open document ID: 1429.05036
author: Katrin Casel
author: Jan Dreier
author: Henning Fernau
author: Moritz Gobbert
author: Philipp Kuinke
author: Fernando Sánchez Villaamil
author: Markus L. Schmid
author: Erik Jan van Leeuwen
published in: Discrete Applied Mathematics
publication date: 2019-12-30T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 7146784
zbMATH Keywords: independency tree
zbMATH Keywords: cliquy tree
zbMATH Keywords: parameterized complexity
zbMATH Keywords: kernelization algorithms
zbMATH Keywords: exact algorithms
Wikidata QID: Q59864851
MaRDI profile type: Publication
full work available at URL: j.dam.2018.08.011
OpenAlex ID: W2898583977
cites work: Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree}
cites work: Spanning trees with pairwise nonadjacent endvertices
cites work: Complexity of spanning tree problems: Part I
cites work: The regenerator location problem
cites work: Deterministic Parameterized Connected Vertex Cover
cites work: Parameterized Algorithms
cites work: FPT algorithms and kernels for the directed \(k\)-leaf problem
cites work: Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
cites work: Q4947393
cites work: Kernelization Lower Bounds Through Colors and IDs
cites work: NP-completeness and degree restricted spanning trees
cites work: Fundamentals of parameterized complexity
cites work: The steiner problem in graphs
cites work: On finding optimal and near-optimal lineal spanning trees
cites work: Q4808679
cites work: On miniaturized problems in parameterized complexity theory
cites work: Q4198056
cites work: Hamilton Paths in Grid Graphs
cites work: Better approximation algorithms for the maximum internal spanning tree problem
cites work: Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree
cites work: Q4904144
cites work: Q4231923
cites work: Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems
cites work: Algorithms and Data Structures
cites work: Approximating the maximum internal spanning tree problem
cites work: Vulnerability bounds on the number of spanning tree leaves
DOI: 10.1016/J.DAM.2018.08.011
description: scientific article