Login / Signup

Planar graphs of bounded degree have bounded queue number.

Michael A. BekosHenry FörsterMartin GronemannTamara MchedlidzeFabrizio MontecchianiChrysanthi N. RaftopoulouTorsten Ueckerdt
Published in: STOC (2019)
Keyphrases
  • bounded degree
  • computational complexity
  • graph theoretic
  • planar graphs
  • image segmentation
  • reinforcement learning
  • special case