Induced Subtrees in Interval Graphs
DOI10.1007/978-3-642-45278-9_20zbMath1407.68362OpenAlexW28626205MaRDI QIDQ2870030
Pim van 't Hof, Martin Milanič, Pinar Heggernes
Publication date: 17 January 2014
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-45278-9_20
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) Graph representations (geometric and intersection representations, etc.) (05C62) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
This page was built for publication: Induced Subtrees in Interval Graphs
