✦ LIBER ✦

Cyclic bandwidth sum of graphs

✍ Scribed by Hao Jianxiu

Book ID: 107500473
Publisher: SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
Year: 2001
Tongue: English
Weight: 264 KB
Volume: 16
Category: Article
ISSN: 1005-1031
DOI: 10.1007/s11766-001-0016-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On bandwidth sums of graphs

✍ Bing Yao; Jianfang Wang 📂 Article 📅 1995 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 395 KB

A study on cyclic bandwidth sum

✍ Ying-Da Chen; Jing-Ho Yan 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 360 KB

Characterization of graphs with equal ba

Characterization of graphs with equal bandwidth and cyclic bandwidth

✍ Peter C.B. Lam; W.C. Shiu; W.H. Chan 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 94 KB

Bandwidth sums of block graphs and cacti

✍ Gerard Jennhwa Chang, Ma-Lian Chia, David Kuo… 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 393 KB

Edge-Bandwidth of Graphs

✍ Jiang, Tao; Mubayi, Dhruv; Shastri, Aditya; West, Douglas B. 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 288 KB

Sum Multicoloring of Graphs

✍ Amotz Bar-Noy; Magnús M. Halldórsson; Guy Kortsarz; Ravit Salman; Hadas Shachnai 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 176 KB

Scheduling dependent jobs on multiple machines is modeled by the graph multicoloring problem. In this paper we consider the problem of minimizing the average completion time of all jobs. This is formalized as the sum multicoloring problem: Given a graph and the number of colors required by each vert