Dynamic graph connectivity in polylogarithmic worst case time - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Bruce M. Kapron, Valerie King, Ben Mountjoy. Dynamic graph connectivity in polylogarithmic worst case time. In Sanjeev Khanna, editor, Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013. pages 1131-1142, SIAM, 2013. [doi]

This author has not been identified. Look up 'Bruce M. Kapron' in GoogleThis author has not been identified. Look up 'Valerie King' in GoogleThis author has not been identified. Look up 'Ben Mountjoy' in Google

runs on WebDSL