Graph Attribution Through Sub-Graphs

Harmen Kastenberg, Arend Rensink*

*Corresponding author for this work

    Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

    2 Citations (Scopus)
    49 Downloads (Pure)

    Abstract

    We offer an alternative to the standard way of formalising attributed graphs. We propose to represent them as graphs with a marked sub-graph that represents the data domain, rather than as tuples of graph and algebra. This is a general construction which can be shown to preserve adhesiveness of categories; it has the advantage of uniformity and gives more flexibility in defining data abstractions. We show equivalence of our formalisation with the standard one, under a suitable encoding of algebras as graphs.
    Original languageEnglish
    Title of host publicationGraph Transformation, Specifications, and Nets
    Subtitle of host publicationIn Memory of Hartmut Ehrig
    EditorsReiko Hecke, Gabriele Taentzer
    Place of PublicationCham
    PublisherSpringer
    Pages245-265
    ISBN (Electronic)978-3-319-75396-6
    ISBN (Print)978-3-319-75395-9
    DOIs
    Publication statusPublished - 7 Feb 2018

    Publication series

    NameLecture Notes in Computer Science
    PublisherSpringer
    Volume10800
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349
    NameTheoretical Computer Science and General Issues
    PublisherSpringer

    Keywords

    • Graph Transformation
    • Attributes

    Fingerprint

    Dive into the research topics of 'Graph Attribution Through Sub-Graphs'. Together they form a unique fingerprint.

    Cite this