[2404.17223] Maximizing Minimum Cycle Bases Intersection
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Computational Complexity

arXiv:2404.17223 (cs)
[Submitted on 26 Apr 2024]

Title:Maximizing Minimum Cycle Bases Intersection

Authors:Dimitri Watel (SAMOVAR, ENSIIE), Marc-Antoine Weisser (GALaC), Dominique Barth (UVSQ, DAVID), Ylène Aboulfath (UVSQ, DAVID), Thierry Mautor (UVSQ, DAVID)
View PDF HTML (experimental)
Abstract: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.
Subjects: Computational Complexity (cs.CC)
Cite as: arXiv:2404.17223 [cs.CC]
  (or arXiv:2404.17223v1 [cs.CC] for this version)
  https://doi.org/10.48550/arXiv.2404.17223

Submission history

From: Dimitri Watel [view email] [via CCSD proxy]
[v1] Fri, 26 Apr 2024 07:49:29 UTC (18 KB)
Full-text links:

Access Paper:

view license
Current browse context:
cs.CC
< prev   |   next >
new | recent | 2024-04
Change to browse by:
cs

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)