Representative Benchmarking and Exact Crossing Number Computation for Graph Drawing Heuristics
Technical University of Munich
Munich, Germany · Chair for Efficient Algorithms
ThesisMunich
- Posted
- 1 October 2026 (5 days ago)
- Deadline
- Not specified
- Department
- Chair for Efficient Algorithms
- Category
- Thesis
- Employment type
- Not specified
- Language
- Not specified
Summary
Bachelor's thesis · Master's thesis. Supervised by Timo Brand. Examiner: Stephen Kobourov.