Graph Inference from a Walk for TRees of Bounded Degree 3 is NP-Complete

Osamu Maruyama, Satoru Miyano. Graph Inference from a Walk for TRees of Bounded Degree 3 is NP-Complete. In Jirí Wiedermann, Petr Hájek, editors, Mathematical Foundations of Computer Science 1995, 20th International Symposium, MFCS 95, Prague, Czech Republic, August 28 - September 1, 1995, Proceedings. Volume 969 of Lecture Notes in Computer Science, pages 257-266, Springer, 1995.

Abstract

Abstract is missing.