Chromatic sets of power graphs and their application to resource placement in multicomputer networks
From MaRDI portal
(Redirected from Publication:980032)
Recommendations
- Resource Placement in Networks Using Chromatic Sets of Power Graphs
- Placement of resources of a computing system on a general graph
- Resource placement in Cartesian product of networks
- Perfect distance-\(d\) placements in 2D toroidal networks
- Quasi-perfect resource placements for two-dimensional toroidal networks
Cites work
- scientific article; zbMATH DE number 4077265 (Why is no real title available?)
- scientific article; zbMATH DE number 192896 (Why is no real title available?)
- scientific article; zbMATH DE number 1919512 (Why is no real title available?)
- scientific article; zbMATH DE number 1445362 (Why is no real title available?)
- scientific article; zbMATH DE number 227006 (Why is no real title available?)
- On powers of chordal graphs and their colorings
- Packing two copies of a tree into its fourth power
- Perfect distance-\(d\) placements in 2D toroidal networks
- Perfect elimination orderings of chordal powers of graphs
Cited in
(8)- On the connectivity and equality of some graphs on finite semigroups
- A generalized chromatic polynomial, acyclic orientations with prescribed sources and sinks, and network reliability
- The \(b\)-chromatic number of powers of hypercube
- Resource Placement in Networks Using Chromatic Sets of Power Graphs
- On \(b\)-coloring of powers of hypercubes
- Intersection graphs of general linear groups
- scientific article; zbMATH DE number 1750105 (Why is no real title available?)
- Placement of resources of a computing system on a general graph
This page was built for publication: Chromatic sets of power graphs and their application to resource placement in multicomputer networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q980032)