WALCOM: ALGORITHMS AND COMPUTATION, PROCEEDINGS 5942 125-135 2010年 [査読有り]
PREIMAGE CONSTRUCTION problem by Kratsch and Hemaspaandra naturally arose from the famous graph reconstruction conjecture. It deals with the algorithmic aspects of the conjecture. We present an O(n(8)) time algorithm for PREIMAGE, CONSTRUCTION on ...
COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PT II 6509 362-+ 2010年 [査読有り]
The graph reconstruction conjecture is a long-standing open problem in graph theory. The conjecture has been verified for all graphs with at most 11 vertices. Further, the conjecture has been verified for regular graphs, trees, disconnected graphs...