✦ LIBER ✦

Comparing Notions of Hierarchical Graph Transformation

✍ Scribed by Giorgio Busatto; Berthold Hoffmann

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 254 KB
Volume: 50
Category: Article
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)00184-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Algebraic hierarchical graph transformat

Algebraic hierarchical graph transformation

✍ Wojciech Palacz 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 298 KB

This paper presents a framework for constructing hierarchical (hyper)graphs, using one of the wellknown categories of traditional flat (hyper)graphs as a base. Hierarchical graphs are obtained from flat graphs by adding a parent assigning function to them. Any graph atom (vertex or edge) can be assi

Hierarchical clustering through morpholo

Hierarchical clustering through morphological graph transformation

✍ Alexander Toet 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 617 KB

Comparing Notions of Computational Entro

Comparing Notions of Computational Entropy

✍ Alexandre Pinto 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 402 KB

A General Notion of Visibility Graphs

✍ Develin; Hartke; Moulton 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 106 KB

On the notion of infinite Hamiltonian gr

On the notion of infinite Hamiltonian graph

✍ R. Halin 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB 👁 1 views

## Abstract Based on the terms “end” and “cofinal spanning subtree” a general notion of Hamiltonicity of infinite graphs is developed. It is shown that the cube of every connected locally finite graph is Hamiltonian in this generalized sense.