載入...
On the Treewidths of Graphs of Bounded Degree
In this paper, we develop a new technique to study the treewidth of graphs with bounded degree. We show that the treewidth of a graph G = (V, E) with maximum vertex degree d is at most [Formula: see text] for sufficiently large d, where C is a constant.
Na minha lista:
| 發表在: | PLoS One |
|---|---|
| Main Authors: | , |
| 格式: | Artigo |
| 語言: | Inglês |
| 出版: |
Public Library of Science
2015
|
| 主題: | |
| 在線閱讀: | https://ncbi.nlm.nih.gov/pmc/articles/PMC4388525/ https://ncbi.nlm.nih.gov/pubmed/25849278 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1371/journal.pone.0120880 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|