A New Median Graph Algorithm

Abstract. Median graph is an important new concept introduced to represent a set of graphs by a representative graph. Computing the median graph is an NP-Complete problem. In this paper, we propose an approximate algorithm for computing the median graph. Our algorithm performs in two steps. It first carries out a node reduction process using a clustering method to extract a subset of most representative node labels. It then searches for the median graph candidates from the reduced subset of node labels according to a deterministic strategy to explore the candidate space. Comparison with the genetic search based algorithm will be reported. This algorithm can be used to build a graph clustering algorithm.