scientific article; zbMATH DE number 3488914
From MaRDI portal
Publication:4070624
Cited in
(10)- Equivalence between the minimum covering problem and the maximum matching problem
- Discrete extremal problems
- Packing of mixed hyperarborescences with flexible roots via matroid intersection
- Reachability in arborescence packings
- Packing of arborescences with matroid constraints via matroid intersection
- Edge-disjoint branchings in temporal digraphs
- Integer programming duality: Price functions and sensitivity analysis
- Immersing complete digraphs
- FPT algorithms for packing k-safe spanning rooted sub(di)graphs
- Adaptive sparsification for matroid intersection
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4070624)
