The Complexity of Minor-Ancestral Graph Properties with Forbidden Pairs
From MaRDI portal
Publication:2907495
DOI10.1007/978-3-642-30642-6_14zbMath1360.68509MaRDI QIDQ2907495
Danny Krizanc, Eli Fox-Epstein
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
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)