Parameterized Complexity of Connected Induced Subgraph Problems

DOI10.1007/978-3-319-07956-1_20zbMath1404.68049OpenAlexW996937398MaRDI QIDQ5251647

Leizhen Cai, Junjie Ye

Publication date: 20 May 2015

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-07956-1_20

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Collaborating with Hans: Some Remaining Wonderments ⋮ Parameterized complexity of finding connected induced subgraphs

This page was built for publication: Parameterized Complexity of Connected Induced Subgraph Problems