FINDING SMALLEST SUPERTREES UNDER MINOR CONTAINMENT

DOI10.1142/S0129054100000259zbMath1320.05127MaRDI QIDQ5249050

Dimitrios M. Thilikos, Naomi Nishimura, Prabhakar Ragde

Publication date: 29 April 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

algorithms; supertrees; minor containment

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C05: Trees

05C83: Graph minors

05C85: Graph algorithms (graph-theoretic aspects)

68P05: Data structures