Computing Cut-Based Hierarchical Decompositions in Almost Linear Time - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Harald Räcke, Chintan Shah, Hanjo Täubig. Computing Cut-Based Hierarchical Decompositions in Almost Linear Time. In Chandra Chekuri, editor, Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014. pages 227-238, SIAM, 2014. [doi]

This author has not been identified. Look up 'Harald Räcke' in GoogleThis author has not been identified. Look up 'Chintan Shah' in GoogleThis author has not been identified. Look up 'Hanjo Täubig' in Google

runs on WebDSL