Mappings for Conflict-Free Access of Paths in Elementary Data Structures

Bertossi, Alan A.; Pinotti, Cristina M.

doi:10.1007/3-540-44968-x_35

Search citation statements

Order By: Relevance

Paper Sections

Select...

Preliminaries1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2002

Publication Types

Select...

Other2

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For (1 = 3, Battiti, Bertossi and Bonuccelli [1] found optimal £(1, 1)-colorings for rings, and bidimensional grids, as well as efficient heuristics for geometric graphs. Optimal £(1,1, ..., 1)-colorings, for any positive integer (1, have been proposed by Bertossi and Pinotti [2] When the channel separation constraint is present, the problem has been studied only for small values of (1. The intractability of the £(2, 1)-coloring has been shown by Griggs and Yeh [7] along with bounds on the number of channels for buses, rings and hypercubes.…”

Section: Preliminariesmentioning

confidence: 99%