论文信息 - The maximum common edge subgraph problem: A polyhedral investigation

The maximum common edge subgraph problem: A polyhedral investigation

In the Maximum Common Edge Subgraph Problem (MCES), given two graphs G and H with the same number of vertices, one has to find a common subgraph of G and H (not necessarily induced) with the maximum number of edges. This problem arises in parallel programming environments, and was first defined in Bokhari (1981) [2]. This paper presents a new integer programming formulation for the MCES and a polyhedral study of this model. Several classes of valid inequalities are identified, most of which are shown to define facets. These findings were incorporated into a branch&cut algorithm we implemented. Experimental results with this algorithm are reported.

[1] Jake K. Aggarwal,et al. A Mapping Strategy for Parallel Processing , 1987, IEEE Transactions on Computers.

[2] Fabrizio Rossi,et al. A branch-and-cut algorithm for the maximum cardinality stable set problem , 2001, Oper. Res. Lett..

[3] Martin W. P. Savelsbergh,et al. Conflict graphs in solving integer programming problems , 2000, Eur. J. Oper. Res..

[4] Shahid H. Bokhari,et al. On the Mapping Problem , 1981, IEEE Transactions on Computers.

[5] J. Ramanujam,et al. Task allocation onto a hypercube by recursive mincut bipartitioning , 1990, C3P.

[6] Peter Willett,et al. Maximum common subgraph isomorphism algorithms for the matching of chemical structures , 2002, J. Comput. Aided Mol. Des..

[7] Peter Willett,et al. RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs , 2002, Comput. J..

[8] Celso C. Ribeiro,et al. Multiprocessor scheduling under precedence constraints: Polyhedral results , 2006, Discret. Appl. Math..

[9] S. Arunkumar,et al. Genetic algorithm based heuristics for the mapping problem , 1995, Comput. Oper. Res..

[10] O. G. Monakhov,et al. Parallel Algorithm for Mapping Parallel Program into Pyramidal Multiprocessor , 1995, PARA.

[11] Peter Willett,et al. Heuristics for Similarity Searching of Chemical Graphs Using a Maximum Common Edge Subgraph Algorithm , 2002, J. Chem. Inf. Comput. Sci..