Graph Attribution Through Sub-Graphs

H. Kastenberg, Arend Rensink

Abstract

We offer an alternative to the standard formalisation of attributed graphs. We propose to represent an attributed graph as a graph with a marked sub-graph, in which the sub-graph represents the data domain, rather than as a tuple 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 languageUndefined
Place of PublicationEnschede
PublisherCentre for Telematics and Information Technology (CTIT)
Number of pages24
StatePublished - Nov 2012

Publication series

NameCTIT Technical Report Series
PublisherCentre for Telematics and Information Technology, University of Twente
No.TR-CTIT-12-27
ISSN (Print)1381-3625

Fingerprint

Graph in graph theory
Formalization
Subgraph
Algebra
Uniformity
Encoding
Flexibility
Equivalence
Alternatives

Keywords

  • Graph Transformation
  • METIS-289788
  • EWI-22534
  • IR-84369
  • Adhesive Cateogries
  • Attributed Graphs

Cite this

Kastenberg, H., & Rensink, A. (2012). Graph Attribution Through Sub-Graphs. (CTIT Technical Report Series; No. TR-CTIT-12-27). Enschede: Centre for Telematics and Information Technology (CTIT).

Kastenberg, H.; Rensink, Arend / Graph Attribution Through Sub-Graphs.

Enschede : Centre for Telematics and Information Technology (CTIT), 2012. 24 p. (CTIT Technical Report Series; No. TR-CTIT-12-27).

Research output: Professional › Report

@book{4468e665053f49669a58a5ec0bc12e55,
title = "Graph Attribution Through Sub-Graphs",
abstract = "We offer an alternative to the standard formalisation of attributed graphs. We propose to represent an attributed graph as a graph with a marked sub-graph, in which the sub-graph represents the data domain, rather than as a tuple 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.",
keywords = "Graph Transformation, METIS-289788, EWI-22534, IR-84369, Adhesive Cateogries, Attributed Graphs",
author = "H. Kastenberg and Arend Rensink",
year = "2012",
month = "11",
series = "CTIT Technical Report Series",
publisher = "Centre for Telematics and Information Technology (CTIT)",
number = "TR-CTIT-12-27",
address = "Netherlands",

}

Kastenberg, H & Rensink, A 2012, Graph Attribution Through Sub-Graphs. CTIT Technical Report Series, no. TR-CTIT-12-27, Centre for Telematics and Information Technology (CTIT), Enschede.

Graph Attribution Through Sub-Graphs. / Kastenberg, H.; Rensink, Arend.

Enschede : Centre for Telematics and Information Technology (CTIT), 2012. 24 p. (CTIT Technical Report Series; No. TR-CTIT-12-27).

Research output: Professional › Report

TY - BOOK

T1 - Graph Attribution Through Sub-Graphs

AU - Kastenberg,H.

AU - Rensink,Arend

PY - 2012/11

Y1 - 2012/11

N2 - We offer an alternative to the standard formalisation of attributed graphs. We propose to represent an attributed graph as a graph with a marked sub-graph, in which the sub-graph represents the data domain, rather than as a tuple 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.

AB - We offer an alternative to the standard formalisation of attributed graphs. We propose to represent an attributed graph as a graph with a marked sub-graph, in which the sub-graph represents the data domain, rather than as a tuple 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.

KW - Graph Transformation

KW - METIS-289788

KW - EWI-22534

KW - IR-84369

KW - Adhesive Cateogries

KW - Attributed Graphs

M3 - Report

T3 - CTIT Technical Report Series

BT - Graph Attribution Through Sub-Graphs

PB - Centre for Telematics and Information Technology (CTIT)

ER -

Kastenberg H, Rensink A. Graph Attribution Through Sub-Graphs. Enschede: Centre for Telematics and Information Technology (CTIT), 2012. 24 p. (CTIT Technical Report Series; TR-CTIT-12-27).

Access to Document