scientific article; zbMATH DE number 6472606
From MaRDI portal
Publication:5501809
Cited in
(6)- A theory and algorithms for combinatorial reoptimization
- Maximum core spanning tree maintenance for large dynamic graphs
- Interdiction of minimum spanning trees and other matroid bases
- Recent advances in fully dynamic graph algorithms (invited talk)
- Maximum core spanning tree insertion maintenance for large dynamic graphs
- Maintaining dynamic minimum spanning trees: an experimental study
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 Q5501809)