zbMATH — the first resource for mathematics

Dynamic-programming algorithms for recognizing small-bandwidth graphs in polynomial time. (English) Zbl 0496.68032

68Q25 Analysis of algorithms and problem complexity
68R10 Graph theory (including graph drawing) in computer science
Full Text: DOI
[1] Aho, AlfredV.; Hopcroft, JohnE.; Ullman, JeffreyD., The design and analysis of computer algorithms, (1975) · Zbl 0326.68005
[2] Garey, M. R.; Graham, R. L.; Johnson, D. S.; Knuth, D. E., Complexity results for bandwidth minimization, SIAM J. Appl. Math., 34, 477, (1978) · Zbl 0385.05048
[3] Garey, MichaelR.; Johnson, DavidS., Computers and intractability, (1979) · Zbl 0411.68039
[4] Garey, M. R.; Johnson, D. S.; Stockmeyer, L., Some simplified NP-complete graph problems, Theoret. Comput. Sci., 1, 237, (1976) · Zbl 0338.05120
[5] Papadimitriou, Ch. H., The NP-completeness of the bandwidth minimization problem, Computing, 16, 263, (1976) · Zbl 0321.65019
[6] 1979Private communication
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.