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
Deterministic Edge Connectivity in Near-Linear Time
Ken-ichi Kawarabayashi,
Mikkel Thorup
15
Citations (Scopus)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Deterministic Edge Connectivity in Near-Linear Time'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Cactus Representation
25%
Conductance
50%
Deterministic Algorithm
75%
Edge-connectivity
100%
Graph Connectivity
25%
High Probability
25%
Lang
25%
Minimum Cut
50%
Minimum Cut Problem
25%
Minimum Degree
25%
Monte Carlo Algorithm
50%
Multigraph
25%
Near-linear Time
100%
Near-Linear Time Algorithm
50%
PageRank
25%
Time Deterministic
25%
Undirected Unweighted Graphs
25%
Vertex Set
25%
Mathematics
Andersson
16%
Edge
50%
Edge-Connectivity
100%
Linear Time
100%
Monte Carlo Algorithm
33%
Multigraph
16%
Probability Theory
16%
Start Vertex
16%
Engineering
Cut Edge
16%
Multigraph
16%