OpenAlex
PricingAboutJobs
Log inGet started
Work

Branch and Tree Decomposition Techniques for Discrete Optimization

HTML

Year: 2005
Type: book-chapter
Parent work: Emerging Theory, Methods, and Applications
DOI: 10.1287/educ.1053.0017
Authors: Illya V. Hicks, Arie M. C. A. Koster, Elif Kolotoğlu
Institutions: Texas A&M University, Zuse Institute Berlin
Language: English

Topic: Advanced Graph Theory Research
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: branch decomposition, tree decomposition, branchwidth, treewidth, graph minors, fixed-parameter tractable algorithms, NP-hard graph problems, monadic second-order logic, traveling salesman problem, frequency assignment

Open Access status: closed
OpenAlex ID: W200045149
FWCI: 11.51
Cites: 115
Cited by: 63
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security