Inproceedings,

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

, , , , , , , and .
Proc. 48th Int. Workshop Graph-Theoretic Concepts Comput. Sci. (WG'22), volume 13453 of Lecture Notes in Computer Science, page 16 pages. Springer-Verlag, (2022)
DOI: 10.1007/978-3-031-15914-5_20

Meta data

Tags

Users

  • @klesen
  • @awolff
  • @j_z

Comments and Reviews