Tight Runtime Bounds for Evolutionary Algorithms on Sorting and Crossing Minimisation for Layered Graph Drawings.
Saved in:
| Title: | Tight Runtime Bounds for Evolutionary Algorithms on Sorting and Crossing Minimisation for Layered Graph Drawings. |
|---|---|
| Authors: | Baumann, Jakob1, baumannjak@fim.uni-passau.de, Rutter, Ignaz1, rutter@fim.uni-passau.de, Sudholt, Dirk1, dirk.sudholt@uni-passau.de |
| Source: | Algorithmica; Jun2026, Vol. 88 Issue 3, p1-50, 50p |
| Database: | Applied Science & Technology Source |
| ISSN: | 01784617 |
|---|---|
| DOI: | 10.1007/s00453-025-01361-5 |
