Maximizing minimum cycle bases intersection
Résumé
In this paper we consider the problem of, given a set of graphs with the same set of vertices, choosing a minimum cycle basis for each of these graphs such that the intersection of these bases has maximal size. We first prove this problem to be NP-complete, then prove its polynomiality for the special case of two graphs and study both the hardness of approximation and the parameterized complexity.
Origine | Fichiers produits par l'(les) auteur(s) |
---|