Computing Circle Packing Representations of Planar Graphs

DOI10.1137/1.9781611975994.174MaRDI QIDQ5146971zbMATH OpenOpenAlexFDO

Authors Sally Dong, Yin Tat Lee, Kent Quanrud

Publication date 2 February 2021

Published in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1911.00612

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(3)

• On optimal beyond-planar graphs
• Approximate counting for spin systems in sub-quadratic time
• Approximate counting for spin systems in sub-quadratic time

This page was built for publication: Computing Circle Packing Representations of Planar Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146971)