
Types for Proofs and Programs
Henk Barendregt, Tobias Nipkow
₹5,576

Computations and Approximations
by Ton Kloks
Free delivery. Nothing extra to pay at checkout.
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.
Description supplied by the publisher.