Graph Attribution Through Sub-Graphs

H. Kastenberg; Arend Rensink

Graph Attribution Through Sub-Graphs

Research output: Book/Report › Report › Professional

70 Downloads (Pure)

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 language	Undefined
Place of Publication	Enschede
Publisher	Centre for Telematics and Information Technology (CTIT)
Number of pages	24
Publication status	Published - Nov 2012

Publication series

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

Keywords

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

Access to Document

paper
open
paper
open

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).

@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",

language = "Undefined",

series = "CTIT Technical Report Series",

publisher = "Centre for Telematics and Information Technology (CTIT)",

number = "TR-CTIT-12-27",

address = "Netherlands",

}

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)

CY - Enschede

ER -