ACM Symposium on Theory of Computing, STOC 2015


Article Details
Title: Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time
Article URLs:
Alternative Article URLs:
Authors: Ken-ichi Kawarabayashi
  • National Institute of Informatics, Tokyo, Japan
Mikkel Thorup
  • University of Copenhagen, Denmark
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/stoc/KawarabayashiT15
Author Comments:

Discuss this paper and its artifacts below