In the size-sensitive independence oracle model, fundamental matroid tasks require quadratic query cost in general but admit subquadratic algorithms when maximum circuit size is bounded by a constant.
2015 IEEE 56th Annual Symposium on Foundations of Computer Science , pages=
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3representative citing papers
A condensed time-expanded network with O(n²μ) nodes and O(μmn) edges solves max flow over time with μ capacity changes in O(μ²n³m) time.
citing papers explorer
-
Matroid Algorithms Under Size-Sensitive Independence Oracles
In the size-sensitive independence oracle model, fundamental matroid tasks require quadratic query cost in general but admit subquadratic algorithms when maximum circuit size is bounded by a constant.
-
Brief announcement: A special case of maximum flow over time with network changes
A condensed time-expanded network with O(n²μ) nodes and O(μmn) edges solves max flow over time with μ capacity changes in O(μ²n³m) time.
- Check, Please: Verifiably Fair Clustering