Parallel solution to Hosoya Index of Graph Problem (Vyukov)

The included code and white paper provides a parallel solution for the Hosoya Index problem, as described in the included problem description text file. The serial code uses the idea of a “sparsest cut” of an input graph. The sparsest cut divides edges of the graph into 3 sets: edges that are a part of the cut, and 2 mutually independent sets. From all matchings in the cut, the index value of the two other subsets can be computed recursively. Parallelism is achieved using Intel Threading Building Blocks.

DISCLAIMER: This code is provided by the author as a submitted contest entry, and is intended for educational use only. The code is not guaranteed to solve all instances of the input data sets and may require modifications to work in your own specific environment.

Des téléchargements sont disponibles sous la licence Creative Commons License. Télécharger maintenant
Reportez-vous à notre Notice d'optimisation pour plus d'informations sur les choix et l'optimisation des performances dans les produits logiciels Intel.