The complexity of minor-ancestral graph properties with forbidden pairs

DOI10.1007/978-3-642-30642-6_14zbMATH Open1360.68509OpenAlexW33827085MaRDI QIDQ2907495FDOQ2907495

Authors: Eli Fox-Epstein, D. Krizanc 

Publication date: 10 September 2012

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-30642-6_14

Recommendations

• The complexity of induced minors and related problems
• scientific article; zbMATH DE number 15355
• scientific article; zbMATH DE number 4094810
• scientific article; zbMATH DE number 1696630
• scientific article; zbMATH DE number 468640

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited In (1)

• Random walks and forbidden minors II

This page was built for publication: The complexity of minor-ancestral graph properties with forbidden pairs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2907495)