Computing with graphs and graph transformations

被引:0
|
作者
Blostein, D [1 ]
Schürr, A
机构
[1] Queens Univ, Dept Comp & Informat Sci, Kingston, ON K7L 3N6, Canada
[2] German Armed Forces Univ, Dept Comp Sci, Inst Software Technol, D-85577 Neubiberg, Germany
来源
SOFTWARE-PRACTICE & EXPERIENCE | 1999年 / 29卷 / 03期
关键词
graphs; graph transformation; graph rewriting; graph grammars; visual languages; recognition of mathematical notation;
D O I
10.1002/(SICI)1097-024X(199903)29:3<197::AID-SPE228>3.3.CO;2-6
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Many software applications require the construction and manipulation of graphs. In standard programming languages, this is accomplished using low-level mechanisms such as pointer manipulation or array indexing. In contrast, graph productions are a convenient high-level visual notation for coding graph modifications. A graph production replaces one subgraph by another subgraph. Graph productions can define a graph grammar and graph language, or can directly transform an input graph into an output graph. Graph transformation has been applied in many areas, including the definition of visual languages and their tools, the construction of software development environments, the definition of constraint programming algorithms, the modeling of distributed systems, and the construction of neural networks. One application is presented in detail: the interpretation of mathematical notation in scanned document images. The graph models the set of mathematical symbols, and their spatial and logical relationships. This graph is transformed by productions written in the PROGRES language. Copyright (C) 1999 John Whey & Sons, Ltd.
引用
收藏
页码:197 / 217
页数:21
相关论文
共 50 条
  • [1] Computing with graphs and graph transformations
    Blostein, Dorothea
    Schürr, Andy
    Software - Practice and Experience, 1999, 29 (03): : 197 - 217
  • [2] Summary of the Workshop on Natural Computing and Graph Transformations
    Petre, Ion
    Rozenberg, Grzegorz
    GRAPH TRANSFORMATIONS, ICGT 2008, 2008, 5214 : 470 - +
  • [3] Parallel Graph Transformations Supported by Replicated Complementary Graphs
    Kotulski, Leszek
    Sedziwy, Adam
    ADAPTIVE AND NATURAL COMPUTING ALGORITHMS, PT II, 2011, 6594 : 254 - 264
  • [4] Hierarchical Graph Transformation Revisited Transformations of Coalgebraic Graphs
    Padberg, Julia
    GRAPH TRANSFORMATION, ICGT 2017, 2017, 10373 : 20 - 35
  • [5] Two Graph Transformations and Their Applications to Matching Theory of Graphs
    Zhang, Hailiang
    Liu, Lu
    MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2021, 86 (03) : 621 - 633
  • [6] Monopolar graphs: Complexity of computing classical graph parameters
    Barbato, Michele
    Bezzi, Dario
    DISCRETE APPLIED MATHEMATICS, 2021, 291 : 277 - 285
  • [7] Bipartite graph matching for computing the edit distance of graphs
    Riesen, Kaspar
    Neuhaus, Michel
    Bunke, Horst
    GRAPH-BASED REPRESENTATIONS IN PATTERN RECOGNITION, PROCEEDINGS, 2007, 4538 : 1 - +
  • [8] Computing graph polynomials on graphs of bounded clique-width
    Makowsky, J. A.
    Rotics, Udi
    Averbouch, Ilya
    Godlin, Benny
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2006, 4271 : 191 - 204
  • [9] Specification and modelling of computing systems through graphs and graph transformation
    Gadducci, Fabio
    Kehrer, Timo
    JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING, 2023, 135
  • [10] COMPUTING THE BOXICITY OF A GRAPH BY COVERING ITS COMPLEMENT BY COINTERVAL GRAPHS
    COZZENS, MB
    ROBERTS, FS
    DISCRETE APPLIED MATHEMATICS, 1983, 6 (03) : 217 - 228