Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Jesse Campion Loth, Kevin Halasz, Tomás Masarík, Bojan Mohar, Robert Sámal. Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic. In David P. Woodruff, editor, Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024. pages 1177-1193, SIAM, 2024. [doi]

This author has not been identified. Look up 'Jesse Campion Loth' in GoogleThis author has not been identified. Look up 'Kevin Halasz' in GoogleThis author has not been identified. Look up 'Tomás Masarík' in GoogleThis author has not been identified. Look up 'Bojan Mohar' in GoogleThis author has not been identified. Look up 'Robert Sámal' in Google

runs on WebDSL