On the treewidths of graphs of bounded degree.
Where this comes from
- Record sourced from PubMed, PMID 25849278.
- Also identified by DOI 10.1371/journal.pone.0120880 and PMC identifier 4388525.
- Licence recorded as CC BY.
- The licence permits redistribution, so the abstract is shown in full and the full text is available from the publisher.
Abstract
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.
Medical subject headings
- Algorithms
- Computer Graphics