Resource placement in Cartesian product of networks
From MaRDI portal
Publication:666104
DOI10.1016/j.jpdc.2009.06.005zbMath1233.68111OpenAlexW2047607057MaRDI QIDQ666104
Albert Y. Zomaya, Hamid Sarbazi-Azad, N. Imani
Publication date: 7 March 2012
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpdc.2009.06.005
Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Mathematical problems of computer architecture (68M07) Distributed systems (68M14)
Cites Work
- Perfect distance-\(d\) placements in 2D toroidal networks
- On the group of the composition of two graphs
- The composition of graphs
- Fault diameter of Cartesian product graphs
- Reliable broadcasting in product networks
- On the fractional chromatic number, the chromatic number, and graph products
- On the total domination number of Cartesian products of graphs
This page was built for publication: Resource placement in Cartesian product of networks
