A constant-time channel-assignment algorithm on reconfigurable meshes

DOI10.1007/BF01994843zbMath0757.68064OpenAlexW3014385727MaRDI QIDQ1195930

Jingyuan Zhang, Stephan Olariu, James L. Schwing

Publication date: 26 January 1993

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01994843

zbMATH Keywords

graph coloringparallel algorithmsVLSICADreconfigurable meshchannel-assignment

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Related Items (1)

A CONSTANT TIME ALGORITHM FOR THE CHANNEL ASSIGNMENT PROBLEM USING THE RECONFIGURABLE MESH

Cites Work

• An Optimal Solution for the Channel-Assignment Problem
• An algorithm for single-row routing with prescribed street congestions

This page was built for publication: A constant-time channel-assignment algorithm on reconfigurable meshes