Treewidth: Computations and Approximations: 842 (Lecture Notes in Computer Science, 842) - Softcover
Synopsis
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.
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Treewidth: Computations and Approximations: 842 (Lecture...
Stock Image
Treewidth: Computations and Approximations (Lecture Notes in Computer Science)
Seller: GuthrieBooks, Spring Branch, TX, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: Very Good. Ex-library paperback in very nice condition with the usual markings and attachments. Text block clean and unmarked. Tight binding. Seller Inventory # UTD14a-0136
Seller Image
Treewidth
Published by
Springer Berlin Heidelberg Aug 1994, 1994
ISBN 10: 3540583564
ISBN 13: 9783540583561
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 228 pp. Englisch. Seller Inventory # 9783540583561
Stock Image
Treewidth
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. pp. 228. Seller Inventory # 263091713
Stock Image
Treewidth
Print on DemandSeller: Majestic Books, Hounslow, United Kingdom
Seller rating 4 out of 5 stars
Condition: New. Print on Demand pp. 228 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. Seller Inventory # 5804766
Buy New
£ 65.04
£ 6.50 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 4 available
Stock Image
Treewidth
Print on DemandSeller: Biblios, Frankfurt am main, HESSE, Germany
Seller rating 4 out of 5 stars
Condition: New. PRINT ON DEMAND pp. 228. Seller Inventory # 183091723
Seller Image
Treewidth
Published by
Springer Berlin Heidelberg, 1994
ISBN 10: 3540583564
ISBN 13: 9783540583561
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 aut. Seller Inventory # 4894676
Buy New
£ 43.24
£ 42.52 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available
Seller Image
Treewidth
Published by
Springer Berlin Heidelberg, Springer Berlin Heidelberg Aug 1994, 1994
ISBN 10: 3540583564
ISBN 13: 9783540583561
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 228 pp. Englisch. Seller Inventory # 9783540583561
Seller Image
Treewidth : Computations and Approximations
Published by
Springer Berlin Heidelberg, 1994
ISBN 10: 3540583564
ISBN 13: 9783540583561
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Seller Inventory # 9783540583561
Stock Image
Treewidth : Computations and Approximations
Seller: Buchpark, Trebbin, Germany
Seller rating 5 out of 5 stars
Condition: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | 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. Seller Inventory # 481517/2