Home

Improved performance guarantees for bandwidth minimization heuristics (draft


Author(s) : Robert Krauthgamer Uriel Feige, 
Publisher : N/A
Publication Date : 1998
ISSN : N/A
Abstract : Given an undirected graph G = (V; E) on n vertices, a linear arrangement (also called ordering, numbering or layout) of the graph vertices is a one-toone,