Resource Placement in Networks Using Chromatic Sets of Power Graphs

DOI10.1007/978-3-540-74510-5_18MaRDI QIDQ3499773zbMATH OpenOpenAlexFDO

Authors N. Imani, Selim G. Akl, Hamid Sarbazi-Azad

Publication date 3 June 2008

Published in Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74510-5_18

zbMATH Keywords

chromatic numberinterconnection networkspower graphsresource placementsymmetric graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Chromatic sets of power graphs and their application to resource placement in multicomputer networks
• Placement of resources of a computing system on a general graph
• Resource placement in Cartesian product of networks
• Placing resource copies on graphs that model the structures of computer systems
• Perfect distance-\(d\) placements in 2D toroidal networks

Cited in

(4)

• Placing resource copies on graphs that model the structures of computer systems
• Placement of resources of a computing system on a general graph
• Resource placement in Cartesian product of networks
• Chromatic sets of power graphs and their application to resource placement in multicomputer networks

This page was built for publication: Resource Placement in Networks Using Chromatic Sets of Power Graphs

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