The Parameterized Complexity of k-Edge Induced Subgraphs

DOI10.1007/978-3-642-31594-7_54zbMath1272.68160OpenAlexW1505314344MaRDI QIDQ2843289

Yijia Chen, Bingkai Lin

Publication date: 12 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31594-7_54

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Separating sets of strings by finding matching patterns is almost always hard

This page was built for publication: The Parameterized Complexity of k-Edge Induced Subgraphs