Graph bandwidth: Difference between revisions

Revision as of 12:52, 16 May 2018

Revision as of 12:05, 1 September 2018

Line 64:

One area is [[sparse matrix]]/[[band matrix]] handling, and general algorithms from this area, such as [[Cuthill–McKee algorithm]], may be applied to find approximate solutions for the graph bandwidth problem.

Another application ___domain is in [[electronic design automation]]. In [[standard cell]] design methodology, typically standard cells have the same height, and their [[placement (EDA)|placement]] is arranged in a number of rows. In this context, graph bandwidth problem models the problem of placement of a set of standard cells in a singesingle row with the goal of minimizing the maximal [[propagation delay]] (which is assumed to be proportional to wire length).

==See also==