Modulus for bases of matroids
From MaRDI portal
Cites work
- A faster algorithm for computing the strength of a network
- Blocking and anti-blocking pairs of polyhedra
- Blocking duality for \(p\)-modulus on networks and applications
- Closure in Independence Systems
- Connectivity and edge-disjoint spanning trees
- Decomposition of Finite Graphs Into Forests
- Edge-Disjoint Spanning Trees of Finite Graphs
- Fairest edge usage and minimum expected overlap for random spanning trees
- Fast approximation for computing the fractional arboricity and extraction of communities of a graph
- Fractional arboricity, strength, and principal partitions in graphs and matroids
- Fractional spanning tree packing, forest covering and eigenvalues
- scientific article; zbMATH DE number 3345048 (Why is no real title available?)
- Lehmans switching game and a theorem of Tutte and Nash-Williams
- Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
- Matroids and the greedy algorithm
- Minimal subfamilies and the probabilistic interpretation for modulus on graphs
- Modulus on graphs as a generalization of standard graph theoretic quantities
- On the Problem of Decomposing a Graph into n Connected Factors
- On the spanning tree polyhedron
- Optimal attack and reinforcement of a network
- Spanning tree modulus for secure broadcast games
- Strongly balanced graphs and random graphs
- Theory of principal partitions revisited
- Topics in Matroid Theory
Cited in
(2)
This page was built for publication: Modulus for bases of matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7016887)
