Skip to main navigation
Skip to search
Skip to main content
University of Copenhagen Research Portal Home
Help & FAQ
Dansk
English
Home
Profiles
Research output
Research units
Press/Media
Activities
Prizes
???studenttheses???
Datasets
Search by expertise, name or affiliation
Fully-dynamic minimum spanning forest with improved worst-case update time
Christian Wulff-Nilsen
*
*
Corresponding author for this work
Department of Computer Science
32
Citations (Scopus)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Fully-dynamic minimum spanning forest with improved worst-case update time'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Fully Dynamic
100%
Update Time
100%
Minimum Spanning Forest
100%
Las Vegas
50%
Decremental
50%
Dynamic Graph
50%
Edge Insertion
25%
Edge Deletion
25%
Conductance
25%
Edge Weight
25%
Query Response Time
25%
Dynamic Connectivity
25%
Novel Technique
25%
Spanning Forest
25%
Unweighted Graph
25%
Computer Science
Data Structure
100%