A Mapping Strategy for Parallel Processing
IEEE Transactions on Computers
Task allocation onto a hypercube by recursive mincut bipartitioning
Journal of Parallel and Distributed Computing
Genetic algorithm based heuristics for the mapping problem
Computers and Operations Research - Special issue on genetic algorithms
Parallel Algorithm for Mapping Parallel Program into Pyramidal Multiprocessor
PARA '95 Proceedings of the Second International Workshop on Applied Parallel Computing, Computations in Physics, Chemistry and Engineering Science
IEEE Transactions on Computers
Multiprocessor scheduling under precedence constraints: Polyhedral results
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
A branch-and-cut algorithm for the maximum cardinality stable set problem
Operations Research Letters
| Hi-index | 0.04 |
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.