Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
