Maximizing minimum cycle bases intersection

DOI10.1007/978-3-031-63021-7_5MaRDI QIDQ7021108zbMATH OpenFDO

Authors Ylène Aboulfath, Dimitri Watel, Marc-Antoine Weisser, Thierry Mautor, D. Barth

Publication date 28 February 2025

Full work available at URL https://doi.org/10.1007/978-3-031-63021-7_5

zbMATH Keywords

complexitymatroids intersection problemminimum cycle basis

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cites work

• A constructive proof of Vizing's theorem
• A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
• An Analysis of the Greedy Heuristic for Independence Systems
• Breaking the O(m 2 n) Barrier for Minimum Cycle Bases
• Computing independent sets in graphs with large girth
• Cycle bases in graphs characterization, algorithms, complexity, and applications
• scientific article; zbMATH DE number 3534506 (Why is no real title available?)
• scientific article; zbMATH DE number 1953186 (Why is no real title available?)
• Linear degree extractors and the inapproximability of max clique and chromatic number
• Maximizing minimum cycle bases intersection
• Relevant cycle hypergraph representation for molecules
• RELEVANT CYCLES IN CHEMICAL REACTION NETWORKS
• Union of all the minimum cycle bases of a graph

Cited in

(1)

• Maximizing minimum cycle bases intersection

This page was built for publication: Maximizing minimum cycle bases intersection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7021108)