A network model for routing-fault-free wavelength selection in WRONoCs design

DOI10.1016/j.endm.2018.02.003zbMath1392.90030OpenAlexW2791751392MaRDI QIDQ1742244

Maddalena Nonato, Marco Gavanelli, Andrea Peano, Davide Bertozzi

Publication date: 11 April 2018

Full work available at URL: http://hdl.handle.net/11392/2384501

zbMATH Keywords

constrained shortest pathnode forbidden pairsWRONoC

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Cites Work

• On the complexity of paths avoiding forbidden pairs
• Conflict-driven answer set solving: from theory to practice
• Shortest paths algorithms: Theory and experimental evaluation

This page was built for publication: A network model for routing-fault-free wavelength selection in WRONoCs design