{"title":"Maximizing Minimum Cycle Bases Intersection","authors":"Dimitri WatelSAMOVAR, ENSIIE, Marc-Antoine WeisserGALaC, Dominique BarthUVSQ, DAVID, Ylène AboulfathUVSQ, DAVID, Thierry MautorUVSQ, DAVID","doi":"arxiv-2404.17223","DOIUrl":null,"url":null,"abstract":"We address a specific case of the matroid intersection problem: given a set\nof graphs sharing the same set of vertices, select a minimum cycle basis for\neach graph to maximize the size of their intersection. We provide a\ncomprehensive complexity analysis of this problem, which finds applications in\nchemoinformatics. We establish a complete partition of subcases based on\nintrinsic parameters: the number of graphs, the maximum degree of the graphs,\nand the size of the longest cycle in the minimum cycle bases. Additionally, we\npresent results concerning the approximability and parameterized complexity of\nthe problem.","PeriodicalId":501024,"journal":{"name":"arXiv - CS - Computational Complexity","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Computational Complexity","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2404.17223","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
