✦ LIBER ✦

Maximum cutwidth problem for graphs

✍ Scribed by Jianxiu Hao

Book ID: 107500595
Publisher: SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
Year: 2003
Tongue: English
Weight: 303 KB
Volume: 18
Category: Article
ISSN: 1005-1031
DOI: 10.1007/s11766-003-0030-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A degree sequence method for the cutwidt

A degree sequence method for the cutwidth problem of graphs

✍ Yixun Lin; Xianglu Li; Aifeng Yang 📂 Article 📅 2002 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 366 KB

Cutwidth of Split Graphs and Threshold G

Cutwidth of Split Graphs and Threshold Graphs

✍ Heggernes, Pinar; Lokshtanov, Daniel; Mihai, Rodica; Papadopoulos, Charis 📂 Article 📅 2011 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 418 KB

Hard graphs for the maximum clique probl

Hard graphs for the maximum clique problem

✍ Cornelis Hoede 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 299 KB

Variable Formulation Search for the Cutw

Variable Formulation Search for the Cutwidth Minimization Problem

✍ Pardo, Eduardo G.; Mladenović, Nenad; Pantrigo, Juan J.; Duarte, Abraham 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 512 KB

The maximum k-colorable subgraph problem

The maximum k-colorable subgraph problem for chordal graphs

✍ Mihalis Yannakakis; Fanica Gavril 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 390 KB

The maximum independent set problem for

The maximum independent set problem for cubic planar graphs

✍ James E. Burns 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 286 KB