Finding induced trees
type: Item
instance of: scholarly article
title: Finding induced trees
zbMATH Open document ID: 1227.05124
published in: Discrete Applied Mathematics
publication date: 2010-04-28T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5702669
zbMATH Keywords: induced subgraph
zbMATH Keywords: induced tree
zbMATH Keywords: \(\mathcal {NP}\)-completeness
zbMATH Keywords: polynomial time algorithm
author: Nicolas Derhy
author: Christophe Picouleau
MaRDI profile type: Publication
full work available at URL: j.dam.2009.02.009
OpenAlex ID: W2013421520
cites work: Q3888545
cites work: Q5615282
cites work: On the complexity of testing for odd holes and induced odd paths
cites work: Recognizing Berge graphs
cites work: The three-in-a-tree problem
cites work: The steiner problem in graphs
cites work: Q4198056
cites work: Detecting induced subgraphs
cites work: Algorithms for Perfectly Contractile Graphs
DOI: 10.1016/J.DAM.2009.02.009
description: scientific article; zbMATH DE number 5702669