Finding induced trees (Q967418): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Nicolas Derhy / rank
Normal rank
 
Property / author
 
Property / author: Christophe Picouleau / rank
Normal rank
 
Property / author
 
Property / author: Nicolas Derhy / rank
 
Normal rank
Property / author
 
Property / author: Christophe Picouleau / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2009.02.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2013421520 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3888545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of testing for odd holes and induced odd paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Berge graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The three-in-a-tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Perfectly Contractile Graphs / rank
 
Normal rank

Latest revision as of 19:28, 2 July 2024

scientific article
Language Label Description Also known as
English
Finding induced trees
scientific article

    Statements

    Finding induced trees (English)
    0 references
    28 April 2010
    0 references
    0 references
    induced subgraph
    0 references
    induced tree
    0 references
    \(\mathcal {NP}\)-completeness
    0 references
    polynomial time algorithm
    0 references
    0 references
    0 references
    0 references