Maximizing Minimum Cycle Bases Intersection - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2024

Maximizing Minimum Cycle Bases Intersection

Résumé

We address a specific case of the matroid intersection problem: given a set of graphs sharing the same set of vertices, select a minimum cycle basis for each graph to maximize the size of their intersection. We provide a comprehensive complexity analysis of this problem, which finds applications in chemoinformatics. We establish a complete partition of subcases based on intrinsic parameters: the number of graphs, the maximum degree of the graphs, and the size of the longest cycle in the minimum cycle bases. Additionally, we present results concerning the approximability and parameterized complexity of the problem.
Fichier principal
Vignette du fichier
IWOCA_2024.pdf (512.78 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04559959 , version 1 (25-04-2024)

Identifiants

  • HAL Id : hal-04559959 , version 1

Citer

Ylène Aboulfath, Dimitri Watel, Marc-Antoine Weisser, Thierry Mautor, Dominique Barth. Maximizing Minimum Cycle Bases Intersection. 2024. ⟨hal-04559959⟩
0 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More