The Complexity of Minor-Ancestral Graph Properties with Forbidden Pairs

DOI10.1007/978-3-642-30642-6_14zbMath1360.68509OpenAlexW33827085MaRDI QIDQ2907495

Eli Fox-Epstein, Danny 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

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)

This page was built for publication: The Complexity of Minor-Ancestral Graph Properties with Forbidden Pairs