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
The minimum
k
-way cut of bounded size is fixed-parameter tractable
Ken-ichi Kawarabayashi,
Mikkel Thorup
52
Citations (Scopus)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'The minimum
k
-way cut of bounded size is fixed-parameter tractable'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Cut Vertex
100%
Planar graph
67%
Simple Graph
34%
Tractability
21%
Graph Classes
20%
Linear-time Algorithm
19%
Hardness
18%
Parameterization
18%
Undirected Graph
17%
Graph in graph theory
17%
Linear Time
16%
Genus
14%
Vertex of a graph
10%
Standards
10%