Designing Hypergraph Layouts to GMPLS Routing Strategies

DOI10.1007/978-3-642-11476-2_6zbMath1274.68004OpenAlexW1553222577MaRDI QIDQ3408160

David Coudert, Fernando Solano Donado, Stéphane Pérennes, Jean-Claude Bermond, Ignasi Sau, Joanna Moulierac

Publication date: 24 February 2010

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11476-2_6

Mathematics Subject Classification ID

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

Related Items (1)

GMPLS label space minimization through hypergraph layouts

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Steiner problem with edge lengths 1 and 2
• Optimal layouts on a chain ATM network
• Directed virtual path layouts in ATM networks
• Biconnectivity approximations and graph carvings

This page was built for publication: Designing Hypergraph Layouts to GMPLS Routing Strategies