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 global minimum cut of a simple graph in near-linear time
Ken-ichi Kawarabayashi,
Mikkel Thorup
Department of Computer Science
30
Citations (Scopus)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Deterministic global minimum cut of a simple graph in near-linear time'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Global Minimum Cut
100%
Minimum Cut
100%
Near-Linear Time Algorithm
100%
Near-linear Time
100%
Edge-connectivity
66%
Multigraph
33%
Undirected Unweighted Graphs
33%
Cactus Representation
33%
Minimum Cut Problem
33%
Time Deterministic
33%
Vertex Set
33%
Mathematics
Simple Graph
100%
Edge-Connectivity
33%
Andersson
16%
Multigraph
16%
Start Vertex
16%
Engineering
Linear Time
100%