GrGen: A Fast SPO-Based Graph Rewriting Tool

  • Rubino Geiß
  • Gernot Veit Batz
  • Daniel Grund
  • Sebastian Hack
  • Adam Szalkowski
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4178)

Abstract

Graph rewriting is a powerful technique that requires graph pattern matching, which is an NP-complete problem. We present GrGen, a generative programming system for graph rewriting, which applies heuristic optimizations. According to Varró’s benchmark it is at least one order of magnitude faster than any other tool known to us.

Our graph rewriting tool implements the well-founded single-pushout approach. We define the notion of search plans to represent different matching strategies and equip these search plans with a cost model, taking the present host graph into account. The task of selecting a good search plan is then viewed as an optimization problem.

For the ease of use, GrGen features an expressive specification language and generates program code with a convenient interface.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Rubino Geiß
    • 1
  • Gernot Veit Batz
    • 1
  • Daniel Grund
    • 1
  • Sebastian Hack
    • 1
  • Adam Szalkowski
    • 1
  1. 1.Universität Karlsruhe (TH)KarlsruheGermany

Personalised recommendations