Caricamento...
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.
Salvato in:
| Pubblicato in: | PLoS One |
|---|---|
| Autori principali: | , |
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
Public Library of Science
2015
|
| Soggetti: | |
| Accesso online: | 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 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne! !
|