Publication:4321827

zbMath0818.05053MaRDI QIDQ4321827

Yanpei Liu

Publication date: 6 August 1995

zbMATH Keywords

trees; NP-complete; cyclic bandwidth problem; cyclic labellings; local density lower bound

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

05C78: Graph labelling (graceful graphs, bandwidth, etc.)

94C15: Applications of graph theory to circuits and networks

Related Items

The cyclic wirelength of trees, Bounding the bandwidths for graphs, Optimal labelling of unit interval graphs, A study on cyclic bandwidth sum