{"product_id":"9783540583561","title":"Lecture Notes in Computer Science: Computations and Approximations","description":"\u003ch1\u003eLecture Notes in Computer Science: Computations and Approximations\u003c\/h1\u003e \u003ch2\u003eKloks, Ton\u003c\/h2\u003e \u003cp\u003eThis 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.\u003cbr\u003eOriginating 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.\u003c\/p\u003e \u003ch3\u003eDetails\u003c\/h3\u003e \u003cp\u003ePublished by: Springer\u003c\/p\u003e \u003cp\u003ePublication Date: 1994-08-26\u003c\/p\u003e \u003cp\u003eFormat: Paperback\u003c\/p\u003e \u003cp\u003eISBN-13: 9783540583561\u003c\/p\u003e \u003cp\u003eDOI: 10.1007\/BFb0045375\u003c\/p\u003e \u003cp\u003eDimensions: 235cm x155cm\u003c\/p\u003e \u003cp\u003ePages: 218\u003c\/p\u003e ","brand":"Springer Berlin Heidelberg","offers":[{"title":"Default Title","offer_id":44676773740684,"sku":"9783540583561","price":49.49,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0710\/9545\/1788\/files\/9783540583561.jpg?v=1773970159","url":"https:\/\/fh90cf-fv.myshopify.com\/products\/9783540583561","provider":"Late Knight Books and Services, LLC","version":"1.0","type":"link"}