Embedding Trees in a Hypercube is NP-Complete

Alan Wagner, Derek G. Corneil. Embedding Trees in a Hypercube is NP-Complete. SIAM Journal on Computing, 19(3):570-590, 1990.

No reviews for this publication, yet.