An algorithm for packing hypertrees

DOI10.1016/J.DISC.2025.114397MaRDI QIDQ7016885zbMATH OpenFDO

Authors Mourad Baïou, Francisco Barahona

Publication date 6 March 2025

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

\(k\)-cut problemhypergraphic matroidspacking hypertrees

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorial aspects of tessellation and tiling problems (05B45) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• scientific article; zbMATH DE number 5485527 (Why is no real title available?)
• scientific article; zbMATH DE number 3512137 (Why is no real title available?)
• A new approach to the maximum-flow problem
• Computing minimum multiway cuts in hypergraphs
• Edge-Disjoint Spanning Trees of Finite Graphs
• LP relaxation and tree packing for minimum k-cut
• Minimum partition of a matroid into independent subsets
• On decomposing a hypergraph into \(k\) connected sub-hypergraphs
• On some algorithmic aspects of hypergraphic matroids
• On the Problem of Decomposing a Graph into n Connected Factors
• Optimal attack and reinforcement of a network
• Packing Spanning Trees
• Packing algorithms for arborescences (and spanning trees) in capacitated graphs
• Tree packing and approximating k-cuts

This page was built for publication: An algorithm for packing hypertrees

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