A lower bound for linear interval routing

DOI10.1007/3-540-61769-8_13MaRDI QIDQ6570919zbMATH OpenFDO

Authors Tamar Eilam, Shlomo Moran, Shmuel Zaks

Publication date 11 July 2024

Full work available at URL https://doi.org/10.1007/3-540-61769-8_13

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• scientific article; zbMATH DE number 3940741 (Why is no real title available?)
• scientific article; zbMATH DE number 3688740 (Why is no real title available?)
• Labelling and Implicit Routing in Networks

This page was built for publication: A lower bound for linear interval routing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6570919)