Login / Signup

The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs.

Ina GoeßmannJonathan KlawitterBoris KlemzFelix KlesenStephen G. KobourovMyroslav KryvenAlexander WolffJohannes Zink
Published in: WG (2022)
Keyphrases
  • max cut
  • planar graphs
  • lower bound
  • computational complexity
  • upper bound
  • worst case
  • graph theory
  • upper and lower bounds
  • online algorithms