Optimal labelling of unit interval graphs

DOI10.1007/BF02662875zbMath0840.05082MaRDI QIDQ1906576

Jinjiang Yuan, Sanming Zhou

Publication date: 4 July 1996

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

zbMATH Keywords

bandwidthlabellingscutwidthunit interval graphbandwidth sumcyclic bandwith

Mathematics Subject Classification ID

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

Related Items

On Cutwidth Parameterized by Vertex Cover, Embedding ray intersection graphs and global curve simplification, Tabu search for the cyclic bandwidth problem, Efficient iterated greedy for the two-dimensional bandwidth minimization problem, Maximum cut on interval graphs of interval count four is NP-complete, On cutwidth parameterized by vertex cover, Lower and upper bounds for the linear arrangement problem on interval graphs, Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time

Cites Work

• Unnamed Item
• Profile minimization problem for matrices and graphs
• Triangulated graphs and the elimination process
• Topological Bandwidth
• Computing the Minimum Fill-In is NP-Complete