Login / Signup

An exponential bound for simultaneous embeddings of planar graphs.

Ritesh GoenkaPardis SemnaniChi Hoi Yip
Published in: CoRR (2023)
Keyphrases
  • planar graphs
  • upper bound
  • worst case
  • lower bound
  • minimum weight
  • low dimensional
  • approximate inference
  • euclidean space
  • undirected graph
  • randomized algorithm