Login / Signup
The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs.
Ina Goeßmann
Jonathan Klawitter
Boris Klemz
Felix Klesen
Stephen G. Kobourov
Myroslav Kryven
Alexander Wolff
Johannes Zink
Published in:
CoRR (2022)
Keyphrases
</>
lower bound
planar graphs
computational complexity
worst case
upper bound
upper and lower bounds
randomized algorithm
learning algorithm
linear programming
max cut