OPTIMAL LINEAR LABELINGS AND EIGENVALUES OF GRAPHS

被引:86
作者
JUVAN, M
MOHAR, B
机构
[1] University of Ljubljana, Department of Mathematics, 61111 Ljubljana
关键词
D O I
10.1016/0166-218X(92)90229-4
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
For several NP-hard optimal linear labeling problems, including the bandwidth, the cutwidth, and the min-sum problem for graphs, a heuristic algorithm is proposed which finds approximative solutions to these problems in polynomial time. The algorithm uses eigenvectors corresponding to the second smallest Laplace eigenvalue of a graph. Although bad in some "degenerate" cases, the algorithm shows fairly good behaviour. Several upper and lower bounds on the bandwidth, cutwidth, and min-p-sums are derived. Most of these bounds are given in terms of Laplace eigenvalues of the graphs. They are used in the analysis of our algorithm and as measures for the error of the obtained approximation to an optimal labeling.
引用
收藏
页码:153 / 168
页数:16
相关论文
共 14 条
[1]   LAMBDA-1, ISOPERIMETRIC-INEQUALITIES FOR GRAPHS, AND SUPERCONCENTRATORS [J].
ALON, N ;
MILMAN, VD .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1985, 38 (01) :73-88
[2]   THE BANDWIDTH PROBLEM FOR GRAPHS AND MATRICES - A SURVEY [J].
CHINN, PZ ;
CHVATALOVA, J ;
DEWDNEY, AK ;
GIBBS, NE .
JOURNAL OF GRAPH THEORY, 1982, 6 (03) :223-254
[3]  
Chung F., 1988, SELECTED TOPICS GRAP, V3, P151
[4]   ON OPTIMAL LINEAR ARRANGEMENTS OF TREES [J].
CHUNG, FRK .
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1984, 10 (01) :43-60
[5]   CONJECTURED MINIMUM VALUATION TREE [J].
CHUNG, FRK .
SIAM REVIEW, 1978, 20 (03) :601-604
[6]  
DEWDNEY AK, 1980, UWO60 DEP COMP SCI R
[7]  
Garey M.R., 1979, COMPUTERS INTRACTABI, V174
[8]   COMPLEXITY RESULTS FOR BANDWIDTH MINIMIZATION [J].
GAREY, MR ;
GRAHAM, RL ;
JOHNSON, DS ;
KNUTH, DE .
SIAM JOURNAL ON APPLIED MATHEMATICS, 1978, 34 (03) :477-495
[9]  
Garey MR, 1974, P 6 ANN ACM S THEOR, P47, DOI DOI 10.1145/800119.803884
[10]  
JUVAN M, UNPUB LAPLACE EIGENV