A bandwidth reduction algorithm for L‐shaped and Z‐shaped grid structured graphs

A bandwidth reduction algorithm for L‐shaped and Z‐shaped grid structured graphs

0.00 Avg rating0 Votes
Article ID: iaor201111213
Volume: 39
Issue: 6
Start Page Number: 441
End Page Number: 446
Publication Date: Nov 2011
Journal: Operations Research Letters
Authors: ,
Keywords: Bandwidth
Abstract:

In this study, we have proposed an effective bandwidth reduction algorithm. This algorithm is modeled mainly for structured graphs such as the L‐structured and Z‐structured graphs of any size. A near optimal value is obtained on implementing the algorithm for the above two structured graphs.

Reviews

Required fields are marked *. Your email address will not be published.