Spanning tree congestion of proper interval graphs
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866914329894322176 |
|---|---|
| author | Otachi, Yota |
| author_facet | Otachi, Yota |
| contents | We show that the spanning tree congestion problem is NP-complete even for proper interval graphs of linear clique-width at most 4. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_13756 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Spanning tree congestion of proper interval graphs Otachi, Yota Data Structures and Algorithms We show that the spanning tree congestion problem is NP-complete even for proper interval graphs of linear clique-width at most 4. |
| title | Spanning tree congestion of proper interval graphs |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2602.13756 |