Mappings for conflict-free access of paths in bidimensional arrays, circular lists, and complete trees

DOI10.1006/jpdc.2002.1860zbMath1004.68005OpenAlexW1998204921MaRDI QIDQ701181

Cristina M. Pinotti, Alan A. Bertossi

Publication date: 16 October 2002

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jpdc.2002.1860

zbMATH Keywords

systemcomplete treefrequency assignmentbidimensional arraycircular listconflict-free accessmapping schememultibank memorypath template

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (5)

Template-driven rainbow coloring of proper interval graphs ⋮ The \(L(2,1)\)-labeling on the skew and converse skew products of graphs ⋮ \(L(2,1)\)-labeling of Kneser graphs and coloring squares of Kneser graphs ⋮ The \(L(2,1)\)-labeling on graphs and the frequency assignment problem ⋮ Template-driven rainbow coloring of proper interval graphs

This page was built for publication: Mappings for conflict-free access of paths in bidimensional arrays, circular lists, and complete trees