Parameterized complexity of finding connected induced subgraphs
type: Item
instance of: scholarly article
title: Parameterized complexity of finding connected induced subgraphs
zbMATH Open document ID: 1332.68067
author: Leizhen Cai
author: Junjie Ye
published in: Theoretical Computer Science
publication date: 2015-12-08T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6517487
zbMATH Keywords: parameterized complexity
zbMATH Keywords: hereditary properties
zbMATH Keywords: connected induced subgraphs
MaRDI profile type: Publication
full work available at URL: j.tcs.2015.05.020
OpenAlex ID: W399388665
cites work: ON DISJOINT CYCLES
cites work: Fixed-parameter tractability of graph modification problems for hereditary properties
cites work: Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems
cites work: Dual Connectedness of Edge-Bicolored Graphs and Beyond
cites work: Parameterized Complexity of Connected Induced Subgraph Problems
cites work: Interval Deletion is Fixed-Parameter Tractable
cites work: Q4393480
cites work: Q4198056
cites work: Parameterized complexity of finding subgraphs with hereditary properties.
cites work: The node-deletion problem for hereditary properties is NP-complete
cites work: Chordal deletion is fixed-parameter tractable
cites work: Obtaining a planar graph by vertex deletion
cites work: Moore graphs and beyond: a survey of the degree/diameter problem
cites work: The parameterized complexity of the induced matching problem
cites work: Q4231923
cites work: An FPT Algorithm for Tree Deletion Set
cites work: Parameterized complexity of the induced subgraph problem in directed graphs
cites work: Finding odd cycle transversals.
DOI: 10.1016/J.TCS.2015.05.020
Recommended article: Parameterized Complexity of Connected Induced Subgraph Problems
Recommended article: Parameterized complexity of finding regular induced subgraphs
Recommended article: Parameterized complexity of the induced subgraph problem in directed graphs
Recommended article: The parameterized complexity of \(k\)-edge induced subgraphs
Recommended article: The Parameterized Complexity of k-Edge Induced Subgraphs
Recommended article: Parameterized complexity of connected even/odd subgraph problems
Recommended article: Parameterized computational complexity of finding small-diameter subgraphs
Recommended article: Parameterized complexity of finding small degree-constrained subgraphs
Recommended article: The parameterised complexity of counting connected subgraphs and graph motifs
description: scientific article; zbMATH DE number 6517487