APA (7th ed.) Citation

Faber, V., & Streib, N. (2026). All-to-all Routing on Kautz Graphs: Regular Routing Beats Shortest Paths.

Chicago Style (17th ed.) Citation

Faber, Vance, and Noah Streib. All-to-all Routing on Kautz Graphs: Regular Routing Beats Shortest Paths. 2026.

MLA (9th ed.) Citation

Faber, Vance, and Noah Streib. All-to-all Routing on Kautz Graphs: Regular Routing Beats Shortest Paths. 2026.

Warning: These citations may not always be 100% accurate.