Maximizing minimum cycle bases intersection - Télécom SudParis Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2022

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.
Fichier principal
Vignette du fichier
MMCBI_AboulfathEtAl__Full_.pdf (536.01 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03851365 , version 1 (14-11-2022)

Identifiants

  • HAL Id : hal-03851365 , version 1

Citer

Ylène Aboulfath, Dimitri Watel, Marc-Antoine Weisser, Thierry Mautor, Dominique Barth. Maximizing minimum cycle bases intersection. 2022. ⟨hal-03851365⟩
101 Consultations
67 Téléchargements

Partager

Gmail Facebook X LinkedIn More