A complete characterization of the path layout construction problem for ATM networks with given hop count and load

DOI10.1007/3-540-63165-8_208zbMath1401.68243OpenAlexW1602820658MaRDI QIDQ4571983

Tamar Eilam, Michele Flammini, Shmuel Zaks

Publication date: 4 July 2018

Published in: Automata, Languages and Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

On the design of efficient ATM routing schemes ⋮ Directed virtual path layouts in ATM networks

Cites Work

• Optimal layouts on a chain ATM network
• Routing with Polynomial Communication-Space Trade-Off
• The virtual path layout problem in fast networks (extended abstract)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A complete characterization of the path layout construction problem for ATM networks with given hop count and load