Creat membership Creat membership
Sign in

Forgot password?

Confirm
  • Forgot password?
    Sign Up
  • Confirm
    Sign In
Creat membership Creat membership
Sign in

Forgot password?

Confirm
  • Forgot password?
    Sign Up
  • Confirm
    Sign In
Collection
For ¥0.57 per day, unlimited downloads CREATE MEMBERSHIP Download

toTop

If you have any feedback, Please follow the official account to submit feedback.

Turn on your phone and scan

home > search >

Optimal channel assignment and L(p, 1)-labeling

Author:
Zhu, Junlei   Bu, Yuehua   Pardalos, Miltiades P.   Du, Hongwei   Wang, Huijuan   Liu, Bin   


Journal:
Journal of Global Optimization


Issue Date:
2018


Abstract(summary):

The optimal channel assignment is an important optimization problem with applications in optical networks. This problem was formulated to the L(p,1)-labeling of graphs by Griggs and Yeh (SIAM J Discrete Math 5:586-595, 1992). A k-L(p,1)-labeling of a graph G is a function is the maximum vertex degree of G. Our proofs are constructive, which can be turned to a labeling (channel assignment) method to reach the upper bounds.


VIEW PDF

The preview is over

If you wish to continue, please create your membership or download this.

Create Membership

Similar Literature

Submit Feedback

This function is a member function, members do not limit the number of downloads