Conflict-free star-access in parallel memory systems
From MaRDI portal
Recommendations
Cited in
(15)- Equitable coloring of some convex polytope graphs
- A polyhedral approach for the equitable coloring problem
- Load balanced mapping of data structures in parallel memory modules for fast and conflict-free templates access
- A tabu search heuristic for the equitable coloring problem
- On the equitable vertex arboricity of complete tripartite graphs
- The equitable vertex arboricity of complete tripartite graphs
- On the equitable vertex arboricity of graphs
- Template-driven rainbow coloring of proper interval graphs
- A DSATUR-based algorithm for the equitable coloring problem
- A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives
- Template-driven rainbow coloring of proper interval graphs
- scientific article; zbMATH DE number 1696651 (Why is no real title available?)
- \((N, p)\)-equitable \(b\)-coloring of graphs
- On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
- Mappings for conflict-free access of paths in bidimensional arrays, circular lists, and complete trees
This page was built for publication: Conflict-free star-access in parallel memory systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q861322)