scientific article; zbMATH DE number 1775391
From MaRDI portal
Publication:4542523
Recommendations
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
- scientific article; zbMATH DE number 1263228
- Randomized fully dynamic graph algorithms with polylogarithmic time per operation
- Maintaining minimum spanning forests in dynamic graphs
- Maintaining minimum spanning trees in dynamic graphs
Cited in
(19)- The dynamic complexity of transitive closure is in DynTC\(^{0}\).
- Recognition of some perfectly orderable graph classes
- Computing large planar regions in terrains, with an application to fracture surfaces
- Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits
- Competitive graph searches
- scientific article; zbMATH DE number 1617242 (Why is no real title available?)
- Fully Dynamic Algorithms for 2-Edge Connectivity
- GoSCAN: decentralized scalable data clustering
- Computing Large Planar Regions in Terrains
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
- Optimal Algorithms for Detecting Network Stability
- An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms
- Faster deterministic fully-dynamic graph connectivity
- A fully dynamic algorithm for maintaining the transitive closure
- Fully dynamic arboricity maintenance
- Certificates and fast algorithms for biconnectivity in fully-dynamic graphs
- Improved dynamic colouring of sparse graphs
- Minimal fill in O(\(n^{2.69}\)) time
- Fast reoptimization for the minimum spanning tree problem
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 Q4542523)
