Skip to main navigation
Skip to search
Skip to main content
Illinois Experts Home
LOGIN & Help
Link opens in a new tab
Search content at Illinois Experts
Home
Profiles
Research units
Research & Scholarship
Datasets
Honors
Press/Media
Activities
Hypergraph k-cut in randomized polynomial time
Karthekeyan Chandrasekaran
, Chao Xu
, Xilin Yu
Industrial and Enterprise Systems Engineering
Siebel School of Computing and Data Science
Research output
:
Chapter in Book/Report/Conference proceeding
›
Conference contribution
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Hypergraph k-cut in randomized polynomial time'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Polynomial Time
100%
K-cut
100%
Hypergraph
100%
Hyperedge
100%
Cutting Problem
44%
Number of Connected Components
22%
Random Contraction
22%
Polynomial-time Algorithm
11%
Vertex Set
11%
Optimum Solution
11%
Multigraph
11%
K-connected
11%
Connected Component
11%
Disjoint Set
11%
Min-cut Algorithm
11%
Densest K-subgraph Problem
11%
Engineering
Connected Component
100%
Polynomial Time
100%
Smaller Subset
66%
Optimum Solution
33%
Disjoint Set
33%
Computer Science
Polynomial Time
100%
Hyperedges
100%
Connected Component
33%
Subgraphs
22%
Polynomial Time Algorithm
11%
Optimum Solution
11%