Interval Routing Schemes for Circular-Arc Graphs

DOI10.1142/S0129054117500046zbMath1360.68646arXiv1202.4160MaRDI QIDQ2979675

Frank Gurski, Patrick Gwydion Poullie

Publication date: 26 April 2017

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1202.4160

zbMATH Keywords

compact routing; circular-arc graphs; cyclic permutations; interval routing

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

68R10: Graph theory (including graph drawing) in computer science

05C62: Graph representations (geometric and intersection representations, etc.)