The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs
- Award ID(s):
- 1712119
- NSF-PAR ID:
- 10354864
- Date Published:
- Journal Name:
- 48th International Workshop on Graph-Theoretic Concepts in Computer Science (WG)
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
No document suggestions found