Talk:Graph bandwidth
I (Manfred W.; 2024-08-01) added chapter cyclically interval graphs. — Preceding unsigned comment added by 2A02:8071:8284:50A0:0:0:0:1530 (talk) 06:16,
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||||||||||||
| ||||||||||||||||||||||||||||
I (Manfred W.; 2024-08-01) added chapter cyclically interval graphs. — Preceding unsigned comment added by 2A02:8071:8284:50A0:0:0:0:1530 (talk) 06:16, 1 August 2024 (UTC)
NP hardness of caterpillar trees
The paper that shows NP hardness for the approximation of caterpillar graphs is using a different definition (hair length 2) than the definition referenced in the linked article. The bandwidth problem for these graphs is easy to solve as it coincides with the local density bound which is easy to compute for those caterpillar graphs. — Preceding unsigned comment added by 134.61.167.50 (talk) 14:03, 23 February 2017 (UTC)
Content Disclaimer
Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.
- The information displayed on this website is sourced in part or in whole from Wikipedia and has been adapted for the purpose of restating it. We strive to provide accurate and relevant information, however:
- There is no guarantee of absolute accuracy. Wikipedia is an open, collaborative project that can be edited by anyone, so information is subject to change.
- It is not intended to constitute professional advice. The content displayed is for informational and educational purposes only. For important decisions (e.g., medical, legal, or financial), please consult a professional.
- Content copyright. Wikipedia is licensed under the Creative Commons Attribution-ShareAlike License (CC BY-SA). This means that content may be reused with appropriate attribution and shared under a similar license.
- Responsible use. Any risk arising from the use of information from this website is entirely the responsibility of the user.