Efficient fully dynamic elimination forests with applications to detecting long paths and cycles - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Jiehua Chen 0001, Wojciech Czerwinski, Yann Disser, Andreas Emil Feldmann, Danny Hermelin, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk, Manuel Sorge, Bartlomiej Wróblewski, Anna Zych-Pawlewicz. Efficient fully dynamic elimination forests with applications to detecting long paths and cycles. In Joseph (Seffi) Naor, Niv Buchbinder, editors, Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022. pages 796-809, SIAM, 2022. [doi]

This author has not been identified. Look up 'Jiehua Chen 0001' in GoogleThis author has not been identified. Look up 'Wojciech Czerwinski' in GoogleThis author has not been identified. Look up 'Yann Disser' in GoogleThis author has not been identified. Look up 'Andreas Emil Feldmann' in GoogleThis author has not been identified. Look up 'Danny Hermelin' in GoogleThis author has not been identified. Look up 'Wojciech Nadara' in GoogleThis author has not been identified. Look up 'Marcin Pilipczuk' in GoogleThis author has not been identified. Look up 'Michal Pilipczuk' in GoogleThis author has not been identified. Look up 'Manuel Sorge' in GoogleThis author has not been identified. Look up 'Bartlomiej Wróblewski' in GoogleThis author has not been identified. Look up 'Anna Zych-Pawlewicz' in Google

runs on WebDSL