Treewidth: Computations and Approximations: 842 (Lecture Notes in Computer Science, 842) - Tapa blanda
Sinopsis
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Reseña del editor
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Resultados de la búsqueda para Treewidth: Computations and Approximations: 842 (Lecture...
Imagen de archivo
Treewidth: Computations and Approximations (Lecture Notes in Computer Science, 842)
Librería: Zubal-Books, Since 1961, Cleveland, OH, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: Very Good. 228 pp., paperback, previous owner's name to front endpaper else very good. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country. Nº de ref. del artículo: ZB1346627
Comprar usado
EUR 36,52
Envío por EUR 3,96
Se envía dentro de Estados Unidos de America
Se envía dentro de Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen de archivo
Treewidth: Computations and Approximations (Lecture Notes in Computer Science, 842)
Publicado por
Springer-Verlag, 1994
ISBN 10: 3540583564
ISBN 13: 9783540583561
Antiguo o usado
Paperback
Librería: Recycle Bookstore, San Jose, CA, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Paperback. Condición: Very Good. This book has a grey ink stamp to the title page, rubbing and surface scratching to both covers, an old paper price sticker on the back cover, and a very gentle uneven aging to the pages, otherwise this book is in very good condition with crisp, unmarked pages, a tight binding, and a strong cover. Nº de ref. del artículo: 1038530
Comprar usado
EUR 36,24
Envío por EUR 5,06
Se envía dentro de Estados Unidos de America
Se envía dentro de Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen del vendedor
Treewidth
Publicado por
Springer Berlin Heidelberg Aug 1994, 1994
ISBN 10: 3540583564
ISBN 13: 9783540583561
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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. Nº de ref. del artículo: 9783540583561
Comprar nuevo
EUR 53,49
Envío por EUR 23,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 2 disponibles
Imagen del vendedor
Treewidth
Publicado por
Springer Berlin Heidelberg, 1994
ISBN 10: 3540583564
ISBN 13: 9783540583561
Nuevo
Tapa blanda
Librería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: 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. Nº de ref. del artículo: 4894676
Comprar nuevo
EUR 48,37
Envío por EUR 48,99
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Treewidth
Publicado por
Springer, Springer Aug 1994, 1994
ISBN 10: 3540583564
ISBN 13: 9783540583561
Nuevo
Taschenbuch
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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 KG, Sachsenplatz 4-6, 1201 Wien 228 pp. Englisch. Nº de ref. del artículo: 9783540583561
Comprar nuevo
EUR 53,49
Envío por EUR 60,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen del vendedor
Treewidth : Computations and Approximations
Publicado por
Springer Berlin Heidelberg, 1994
ISBN 10: 3540583564
ISBN 13: 9783540583561
Nuevo
Taschenbuch
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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. Nº de ref. del artículo: 9783540583561
Comprar nuevo
EUR 53,49
Envío por EUR 61,77
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen del vendedor
Treewidth | Computations and Approximations
Librería: preigu, Osnabrück, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. Treewidth | Computations and Approximations | Ton Kloks | Taschenbuch | x | Englisch | 1994 | Springer | EAN 9783540583561 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Nº de ref. del artículo: 101894307
Comprar nuevo
EUR 50,25
Envío por EUR 70,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 5 disponibles
Imagen de archivo
Treewidth : Computations and Approximations
Publicado por
Springer Spektrum, 1994
ISBN 10: 3540583564
ISBN 13: 9783540583561
Antiguo o usado
Tapa blanda
Librería: Buchpark, Trebbin, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: 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. Nº de ref. del artículo: 481517/2
Comprar usado
EUR 39,94
Envío por EUR 105,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles