加载中…
2026-02-14
Spanning tree congestion of proper interval graphs
Yota Otachi
文献摘要
We show that the spanning tree congestion problem is NP-complete even for proper interval graphs of linear clique-width at most 4.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本