Faster Fully-Dynamic Minimum Spanning Forest (Q3452837)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Faster Fully-Dynamic Minimum Spanning Forest	scientific article

Statements

scholarly article

0 references

Faster Fully-Dynamic Minimum Spanning Forest (English)

0 references

0 references

0 references

Christian Wulff-Nilsen

0 references

Algorithms - ESA 2015

0 references

publication date

19 November 2015

0 references

full work available at URL

https://arxiv.org/abs/1407.6832

0 references

MaRDI profile type

MaRDI publication profile

0 references

Maintaining information in fully dynamic trees with top trees

0 references

Sorting in linear time?

0 references

Sparsification—a technique for speeding up dynamic graph algorithms

0 references

Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications

0 references

Randomized fully dynamic graph algorithms with polylogarithmic time per operation

0 references

Sampling to provide or to bound: With applications to fully dynamic graph algorithms

0 references

Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity

0 references

Lower bounds for dynamic connectivity

0 references

Near-optimal fully-dynamic graph connectivity

0 references

Randomized Sorting in O(nloglogn) Time and Linear Space Using Addition, Shift, and Bit-wise Boolean Operations

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-662-48350-3_62

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3452837

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3452837&oldid=36214398"