Computing the Minimum Error Distance of Graphs in 0(n3) Time with Precedence Graph Grammars
- 1 January 1988
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Inexact graph matching for structural pattern recognitionPattern Recognition Letters, 1983
- Graph-Grammars and Their Application to Computer ScienceLecture Notes in Computer Science, 1983
- Structural Descriptions and Inexact MatchingIEEE Transactions on Pattern Analysis and Machine Intelligence, 1981
- On the structure of node-label-controlled graph languagesInformation Sciences, 1980
- Graph-Grammars and Their Application to Computer Science and BiologyPublished by Springer Nature ,1979
- Graph-GrammatikenPublished by Springer Nature ,1979
- A class of linearly parsable graph grammarsActa Informatica, 1978
- Symmetrical precedence relations on general phrase structure grammarsThe Computer Journal, 1974
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- Semantics of context-free languagesTheory of Computing Systems, 1968