Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization
From MaRDI portal
Publication:2867073
DOI10.1007/978-3-319-03898-8_7zbMath1309.68084arXiv1306.2217OpenAlexW1579288166MaRDI QIDQ2867073
Vangelis Th. Paschos, Édouard Bonnet, Bruno Escoffier, Emeric Tourniaire
Publication date: 10 December 2013
Published in: Parameterized and Exact Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.2217
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)
