An Algebra of Hierarchical Graphs

Roberto Bruni; Fabio Gadducci; Alberto Lluch Lafuente

doi:10.1007/978-3-642-15640-3_14

An Algebra of Hierarchical Graphs

Roberto Bruni
, Fabio Gadducci
, Alberto Lluch Lafuente

University of Pisa
IMT Institute for Advanced Studies Lucca

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Abstract

We define an algebraic theory of hierarchical graphs, whose axioms characterise graph isomorphism: two terms are equated exactly when they represent the same graph. Our algebra can be understood as a high-level language for describing graphs with a node-sharing, embedding structure, and it is then well suited for defining graphical representations of software models where nesting and linking are key aspects.

Original language	English
Title of host publication	Trustworthly Global Computing : 5th International Symposium, TGC 2010, Munich, Germany, February 24-26, 2010, Revised Selected Papers
Publisher	Springer Berlin Heidelberg
Publication date	2010
Pages	205-221
ISBN (Print)	978-3-642-15639-7
ISBN (Electronic)	978-3-642-15640-3
DOIs	https://doi.org/10.1007/978-3-642-15640-3_14
Publication status	Published - 2010
Externally published	Yes
Event	5th Symposium on Trustworthy Global Computing - Munich, Germany Duration: 24 Feb 2010 → 26 Feb 2010 Conference number: 5

Conference

Conference	5th Symposium on Trustworthy Global Computing
Number	5
Country/Territory	Germany
City	Munich
Period	24/02/2010 → 26/02/2010

Series	Lecture Notes in Computer Science
Volume	6084
ISSN	0302-9743

Access to Document

10.1007/978-3-642-15640-3_14

OpenUrl availability

Check availability in DTU Findit

Cite this

@inproceedings{b53848e0952a4374960d8fe4e3c71462,

title = "An Algebra of Hierarchical Graphs",

abstract = "We define an algebraic theory of hierarchical graphs, whose axioms characterise graph isomorphism: two terms are equated exactly when they represent the same graph. Our algebra can be understood as a high-level language for describing graphs with a node-sharing, embedding structure, and it is then well suited for defining graphical representations of software models where nesting and linking are key aspects.",

author = "Roberto Bruni and Fabio Gadducci and \{Lluch Lafuente\}, Alberto",

year = "2010",

doi = "10.1007/978-3-642-15640-3\_14",

language = "English",

isbn = "978-3-642-15639-7",

series = "Lecture Notes in Computer Science",

publisher = "Springer Berlin Heidelberg",

pages = "205--221",

booktitle = "Trustworthly Global Computing",

note = "5th Symposium on Trustworthy Global Computing, TGC'10 ; Conference date: 24-02-2010 Through 26-02-2010",

}

Bruni, R, Gadducci, F & Lluch Lafuente, A 2010, An Algebra of Hierarchical Graphs. in Trustworthly Global Computing: 5th International Symposium, TGC 2010, Munich, Germany, February 24-26, 2010, Revised Selected Papers. Springer Berlin Heidelberg, Lecture Notes in Computer Science, vol. 6084, pp. 205-221, 5th Symposium on Trustworthy Global Computing, Munich, Germany, 24/02/2010. https://doi.org/10.1007/978-3-642-15640-3_14

An Algebra of Hierarchical Graphs. / Bruni, Roberto; Gadducci, Fabio; Lluch Lafuente, Alberto.
Trustworthly Global Computing: 5th International Symposium, TGC 2010, Munich, Germany, February 24-26, 2010, Revised Selected Papers. Springer Berlin Heidelberg, 2010. p. 205-221 (Lecture Notes in Computer Science, Vol. 6084).

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

TY - GEN

T1 - An Algebra of Hierarchical Graphs

AU - Bruni, Roberto

AU - Gadducci, Fabio

AU - Lluch Lafuente, Alberto

N1 - Conference code: 5

PY - 2010

Y1 - 2010

N2 - We define an algebraic theory of hierarchical graphs, whose axioms characterise graph isomorphism: two terms are equated exactly when they represent the same graph. Our algebra can be understood as a high-level language for describing graphs with a node-sharing, embedding structure, and it is then well suited for defining graphical representations of software models where nesting and linking are key aspects.

AB - We define an algebraic theory of hierarchical graphs, whose axioms characterise graph isomorphism: two terms are equated exactly when they represent the same graph. Our algebra can be understood as a high-level language for describing graphs with a node-sharing, embedding structure, and it is then well suited for defining graphical representations of software models where nesting and linking are key aspects.

U2 - 10.1007/978-3-642-15640-3_14

DO - 10.1007/978-3-642-15640-3_14

M3 - Article in proceedings

SN - 978-3-642-15639-7

T3 - Lecture Notes in Computer Science

SP - 205

EP - 221

BT - Trustworthly Global Computing

PB - Springer Berlin Heidelberg

T2 - 5th Symposium on Trustworthy Global Computing

Y2 - 24 February 2010 through 26 February 2010

ER -

An Algebra of Hierarchical Graphs

Abstract

Conference

Access to Document

OpenUrl availability

Fingerprint

Cite this