menu
{ "item_title" : "Graph Structure and Monadic Second-Order Logic", "item_author" : [" Bruno Courcelle", "Joost Engelfriet "], "item_description" : "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 author not only provides a thorough description of the theory, but also details 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.", "item_img_path" : "https://covers4.booksamillion.com/covers/bam/0/52/189/833/0521898331_b.jpg", "price_data" : { "retail_price" : "240.00", "online_price" : "240.00", "our_price" : "240.00", "club_price" : "240.00", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Graph Structure and Monadic Second-Order Logic|Bruno Courcelle

Graph Structure and Monadic Second-Order Logic

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

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 author not only provides a thorough description of the theory, but also details 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.

This item is Non-Returnable

Details

  • ISBN-13: 9780521898331
  • ISBN-10: 0521898331
  • Publisher: Cambridge University Press
  • Publish Date: June 2012
  • Dimensions: 9.2 x 6 x 1.6 inches
  • Shipping Weight: 2.8 pounds
  • Page Count: 744

Related Categories

You May Also Like...

    1

BAM Customer Reviews