Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs
PREMAGE 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 permutation graphs and an O(n(4)(n + m)) time algorithm for PREIMAGE CONSTRUCTION on distance-hereditary graphs, where n is the number of graphs in the input, and m is the number of edges in a preimage: Since each graph of the input has n - 1 vertices and O(n(2)) edges, the input size is O(n(3)) (, or O(nm)). There are polynomial time isomorphism algorithms for permutation graphs and distance-hereditary graphs. However the number of permutation (distance-hereditary) graphs obtained by adding a vertex to a permutation (distance-hereditary) graph is generally exponentially large. Thus exhaustive checking of these graphs does not achieve any polynomial time algorithm. Therefore reducing the number of preimage candidates is the key point.
permutation graphs polynomial time algorithm the graph reconstruction conjecture