ACM Symposium on Discrete Algorithms, SODA 2014


Article Details
Title: Computing Cut-Based Hierarchical Decompositions in Almost Linear Time
Article URLs:
Alternative Article URLs:
Authors: Harald Räcke
  • Technische Universität München, Garching, Germany, Department of Computer Science
Chintan Shah
  • Technische Universität München, Garching, Germany, Department of Computer Science
Hanjo Täubig
  • Technische Universität München, Garching, Germany, Department of Computer Science
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/soda/RackeST14
Author Comments:

Discuss this paper and its artifacts below