Skip to main content
Book Chapter

Algorithmic Aspects of Tree Width

  • Reed B
Springer New York, (2003), 85-107
DOI: 10.1007/0-387-22444-0_4
N/ACitations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Reed, B. A. (2003). Algorithmic Aspects of Tree Width. In Recent Advances in Algorithms and Combinatorics (pp. 85–107). Springer New York. https://doi.org/10.1007/0-387-22444-0_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free