Hypergraph partitioning into hyperforests
From MaRDI portal
Combinatorial aspects of finite geometries (05B25) Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40)
Cites work
- A Fast Parametric Maximum Flow Algorithm and Applications
- A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
- A new approach to the maximum-flow problem
- An algorithm for packing hypertrees
- Connections in combinatorial optimization
- Decomposition of Finite Graphs Into Forests
- Edge-Disjoint Spanning Trees of Finite Graphs
- Forests, frames, and games: Algorithms for matroid sums and applications
- scientific article; zbMATH DE number 3512137 (Why is no real title available?)
- scientific article; zbMATH DE number 3313442 (Why is no real title available?)
- Matroids and the greedy algorithm
- Maximum flow and minimum-cost flow in almost-linear time
- 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
- Packing algorithms for arborescences (and spanning trees) in capacitated graphs
- Submodular functions and optimization.
- Testing membership in matroid polyhedra
This page was built for publication: Hypergraph partitioning into hyperforests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7411204)
