ロード中...
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.
保存先:
| 出版年: | PLoS One |
|---|---|
| 主要な著者: | , |
| フォーマット: | 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 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|