Detecting induced star-like minors in polynomial time
DOI10.1016/J.JDA.2012.11.002zbMATH Open1267.68122OpenAlexW1969172826MaRDI QIDQ2376792FDOQ2376792
Authors: Daniël Paulusma, Jiří Fiala, Marcin Kamiński 
Publication date: 24 June 2013
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2012.11.002
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph minors (05C83)
Cites Work
- Graph minors. XIII: The disjoint paths problem
- Title not available (Why is that?)
- On the complexity of finding iso- and other morphisms for partial \(k\)- trees
- The complexity of induced minors and related problems
- On graph contractions and induced minors
- Edge contractions in subclasses of chordal graphs
- Finding contractions and induced minors in chordal graphs via disjoint paths
- The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases
- Contractions of Planar Graphs in Polynomial Time
- The computational complexity of graph contractions II: Two tough polynomially solvable cases
- Contractibility and NP-completeness
- Contracting a chordal graph to a split graph or a tree
- Corrigendum to: On the complexity of testing for odd holes and induced odd paths
Cited In (6)
This page was built for publication: Detecting induced star-like minors in polynomial time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2376792)
