Zustand: Neuf.
Sprache: Englisch
Verlag: Cambridge University Press, 2012
ISBN 10: 0521898331 ISBN 13: 9780521898331
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 218,23
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 302,60
Anzahl: 2 verfügbar
In den WarenkorbHardcover. Zustand: Brand New. 1st edition. 700 pages. 9.37x6.06x1.73 inches. In Stock.
Sprache: Englisch
Verlag: Cambridge University Press, 2012
ISBN 10: 0521898331 ISBN 13: 9780521898331
Anbieter: Kennys Bookstore, Olney, MD, USA
EUR 314,83
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. This book unifies and synthesizes research on graph structure over the last 25 years. The definitive reference for graduate students and researchers. Series: Encyclopedia of Mathematics and Its Applications. Num Pages: 744 pages, 25 b/w illus. BIC Classification: PBC; PBD. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 234 x 163 x 43. Weight in Grams: 1276. . 2012. Illustrated. hardcover. . . . . Books ship from the US and Ireland.
Sprache: Englisch
Verlag: Cambridge University Press, 2012
ISBN 10: 0521898331 ISBN 13: 9780521898331
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The study of graph structure has advanced in recent years with great strides: finite graphs can be described algebraically, enabling them to be constructed out of more basic elements. Separately the properties of graphs can be studied in a logical language called monadic second-order logic. In this book, these two features of graph structure are brought together for the first time in a presentation that unifies and synthesizes research over the last 25 years. The authors not only provide a thorough description of the theory, but also detail its applications, on the one hand to the construction of graph algorithms, and, on the other to the extension of formal language theory to finite graphs. Consequently the book will be of interest to graduate students and researchers in graph theory, finite model theory, formal language theory, and complexity theory.