๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Hierarchical clustering through morphological graph transformation

โœ Scribed by Alexander Toet

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
617 KB
Volume
12
Category
Article
ISSN
0167-8655

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Hierarchical Graph Transformation
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

Parallel Algorithms for Hierarchical Clu
Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition
โœ Elias Dahlhaus ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 306 KB

We present efficient parallel algorithms for two hierarchical clustering heuristics. We point out that these heuristics can also be applied to solving some algorithmic problems in graphs, including split decomposition. We show that efficient parallel split decomposition induces an efficient parallel