TY - BOOK ID - 2533820 TI - Treewidth : computations and approximations PY - 1994 VL - 842 SN - 0387583564 3540583564 3540486720 PB - Berlin New York Springer-Verlag DB - UniCat KW - Trees (Graph theory) KW - Data processing KW - Trees (Graph theory) - Data processing. KW - Information theory. KW - Computer software. KW - Combinatorics. KW - Computer graphics. KW - Theory of Computation. KW - Algorithm Analysis and Problem Complexity. KW - Computer Graphics. KW - Automatic drafting KW - Graphic data processing KW - Graphics, Computer KW - Computer art KW - Graphic arts KW - Electronic data processing KW - Engineering graphics KW - Image processing KW - Combinatorics KW - Algebra KW - Mathematical analysis KW - Software, Computer KW - Computer systems KW - Communication theory KW - Communication KW - Cybernetics KW - Digital techniques UR - https://www.unicat.be/uniCat?func=search&query=sysid:2533820 AB - This treatise investigates a number of problems related to treewidth and pathwidth of graphs. The main objective is to obtain good bounds on the complexity of determining the treewidth and pathwidth for various classes of graphs. Originating from the author's Ph.D. thesis, this monograph presents original own work. Nevertheless, many interesting perspectives beyond are presented. In total, the book is a smooth introduction to the topic of graphs of bounded treewidth. It will help to satisfy the strong interest among the algorithmic graph theory community in the theory pertaining to the topic. Particularly valuable is the thorough survey given of the relevant current literature. ER -