An Algorithm for Hypergraph Completion According to Hyperedge Replacement Grammars

Authors:
Steffen Mazanek;Sonja Maier;Mark Minas
Affiliations:
Universität der Bundeswehr München, Germany;Universität der Bundeswehr München, Germany;Universität der Bundeswehr München, Germany
Venue:
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Year:
2008

Citing 9
Cited 2

Specification of error distances for graphs by precedence graphy grammars and fast recognition of similarity

International Workshop WG '86 on Graph-theoretic concepts in computer science
The complexity of graph languages generated by hyperedge replacement

Acta Informatica
Hyperedge replacement graph grammars

Handbook of graph grammars and computing by graph transformation
Concepts and realization of a diagram editor generator based on hypergraph transformation

Science of Computer Programming - Special issue on applications of graph transformations (GRATRA 2000)
AToM3: A Tool for Multi-formalism and Meta-modelling

FASE '02 Proceedings of the 5th International Conference on Fundamental Approaches to Software Engineering
An Error-Correction Graph Grammar to Recognize Texture Symbols

GREC '01 Selected Papers from the Fourth International Workshop on Graphics Recognition Algorithms and Applications
Estimation of Distribution Algorithms: A New Evolutionary Computation Approach for Graph Matching Problems

EMMCVPR '01 Proceedings of the Third International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition
Functional-Logic Graph Parser Combinators

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Building syntax-aware editors for visual languages

Journal of Visual Languages and Computing

Business Process Models as a Showcase for Syntax-Based Assistance in Diagram Editors

MODELS '09 Proceedings of the 12th International Conference on Model Driven Engineering Languages and Systems
Constructing a bidirectional transformation between BPMN and BPEL with a functional logic programming language

Journal of Visual Languages and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The algorithm of Cocke, Younger, and Kasami is a dynamic programming technique well-known from string parsing. It has been adopted to hypergraphs successfully by Lautemann. Therewith, many practically relevant hypergraph languages generated by hyperedge replacement can be parsed in an acceptable time. In this paper we extend this algorithm by hypergraph completion: If necessary, appropriate fresh hyperedges are inserted in order to construct a derivation. The resulting algorithm is reasonably efficient and can be directly used, among other things, for auto-completion in the context of diagram editors.