Detecting induced star-like minors in polynomial time (Q2376792): 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: Jiří Fiala / rank
Normal rank
 
Property / author
 
Property / author: Marcin Kaminski / rank
Normal rank
 
Property / author
 
Property / author: Jiří Fiala / rank
 
Normal rank
Property / author
 
Property / author: Marcin Kaminski / 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.jda.2012.11.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1969172826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge Contractions in Subclasses of Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrigendum to: On the complexity of testing for odd holes and induced odd paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contractibility and NP-completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of induced minors and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contracting a Chordal Graph to a Split Graph or a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graph contractions and induced minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contractions of Planar Graphs in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of graph contractions II: Two tough polynomially solvable cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of finding iso- and other morphisms for partial \(k\)- trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank

Latest revision as of 14:22, 6 July 2024

scientific article
Language Label Description Also known as
English
Detecting induced star-like minors in polynomial time
scientific article

    Statements

    Detecting induced star-like minors in polynomial time (English)
    0 references
    0 references
    0 references
    0 references
    24 June 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    induced minor
    0 references
    tree
    0 references
    computational complexity
    0 references
    0 references