Parameterized complexity of connected induced subgraph problems

DOI10.1007/978-3-319-07956-1_20MaRDI QIDQ5251647zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Parameterized complexity of finding connected induced subgraphs
• scientific article; zbMATH DE number 1696630
• Parameterized complexity of finding subgraphs with hereditary properties.
• Finding connected secluded subgraphs
• Parameterized complexity of the induced subgraph problem in directed graphs

Cited in

(8)

• Parameterized complexity of connected even/odd subgraph problems
• Collaborating with Hans: Some Remaining Wonderments
• Parameterized complexity of finding connected induced subgraphs
• The Parameterized Complexity of k-Edge Induced Subgraphs
• scientific article; zbMATH DE number 1696630 (Why is no real title available?)
• Finding connected secluded subgraphs
• Finding connected secluded subgraphs
• Parameterized complexity of the induced subgraph problem in directed graphs

This page was built for publication: Parameterized complexity of connected induced subgraph problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5251647)