Maximizing minimum cycle bases intersection - Laboratoire Interdisciplinaire des Sciences du Numérique Access content directly
Preprints, Working Papers, ... Year : 2022

Maximizing minimum cycle bases intersection

Abstract

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
Origin : Files produced by the author(s)

Dates and versions

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

Identifiers

  • HAL Id : hal-03851365 , version 1

Cite

Ylène Aboulfath, Dimitri Watel, Marc-Antoine Weisser, Thierry Mautor, Dominique Barth. Maximizing minimum cycle bases intersection. 2022. ⟨hal-03851365⟩
122 View
74 Download

Share

Gmail Facebook X LinkedIn More