B. Monien and I. H. Sudborough. Bandwidth problems in graphs. In Allerton Conference on Communication, Control, and Computing, pages 650--659, 1980. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On The Probable Performance Of Heuristics - For Bandwidth Minimization (Correct)
....Several heuristic algorithms for bandwidth minimization were proposed in the late sixties and early seventies. More recently, Saxe [10] has found a dynamic programming algorithm which can determine if a graph has bandwidth k in time O(n k 1 ) for any fixed value of k. Monien and Sudborough [8] showed how to reduce the time bound to O(n ) One of the most successful heuristic algorithms is one discovered by Cuthill and McKee [5] which is a member of a class Computer Science Department, Campus Box 1045, Washington University, St. Louis, Missouri 63130, ....
Monien, B., I. H. Sudborough. "Bandwidth Problems in Graphs". In Proceedings 18th Annual Allerton Conference on Communication, Control, and Computing, 650-659, 1980.
Confronting Hardness Using a Hybrid Approach - Vassilevska, Williams, Woo (2005) (Correct)
No context found.
B. Monien and I. H. Sudborough. Bandwidth problems in graphs. In Allerton Conference on Communication, Control, and Computing, pages 650--659, 1980.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC