✦ LIBER ✦

Distributed Graphs and Graph Transformation

✍ Scribed by Gabriele Taentzer

Book ID: 110266197
Publisher: Springer
Year: 1999
Tongue: English
Weight: 271 KB
Volume: 7
Category: Article
ISSN: 0927-2852
DOI: 10.1023/a:1008683005045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Verifying distributed real-time properti

Verifying distributed real-time properties of embedded systems via graph transformations and model checking

✍ Gabor Madl; Sherif Abdelwahed; Douglas C. Schmidt 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 863 KB

Computing with graphs and graph transfor

Computing with graphs and graph transformations

✍ Dorothea Blostein; Andy Schürr 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 550 KB

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 gra

Hierarchical Graph Transformation

✍ Frank Drewes; Berthold Hoffmann; Detlef Plump 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 367 KB

When graph transformation is used for programming purposes, large graphs should be structured in order to be comprehensible. In this paper, we present an approach for the rule-based transformation of hierarchically structured hypergraphs. In these graphs, distinguished hyperedges contain graphs that

Bidirectionalizing graph transformations

✍ Hidaka, Soichiro; Hu, Zhenjiang; Inaba, Kazuhiro; Kato, Hiroyuki; Matsuda, Kazut 📂 Article 📅 2010 🏛 Association for Computing Machinery ⚖ 628 KB

Bidirectionalizing graph transformations

✍ Hidaka, Soichiro; Hu, Zhenjiang; Inaba, Kazuhiro; Kato, Hiroyuki; Matsuda, Kazut 📂 Article 📅 2010 🏛 Association for Computing Machinery ⚖ 628 KB

Bidirectional transformations provide a novel mechanism for synchronizing and maintaining the consistency of information between input and output. Despite many promising results on bidirectional transformations, these have been limited to the context of relational or XML (tree-like) databases. We ch

About randomised distributed graph colou

About randomised distributed graph colouring and graph partition algorithms

✍ Y. Métivier; J.M. Robson; N. Saheb-Djahromi; A. Zemmari 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 262 KB