HP-Graph as a Basis of a DSM Platform Visual Model Editor

Suvorov, Nikolai Mikhailovich; Lyadova, Lyudmila N.

doi:10.15514/ispras-2020-32(2)-12

Cited by 3 publications

(5 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This model unites expressive possibilities of all the mentioned graph types and, thus, it can be used for building more complicated models than those which can be built with the help of the other graph models. The paper [7] proved that this graph model allows the creation of a flexible visual model editor based on it. This model is proposed as a basis for domain-specific modeling, one of the key aspects of which is model transformations.…”

Section: Introductionmentioning

confidence: 92%

“…Let Pol be a set of all poles of the graph, including external poles and internal poles of vertices and hyperedges. Then, an HP-graph is an ordered triple G = (P, V, W), where P = 1 n} is a set of external poles, V = {v1 vm} is a non-empty set of vertices, W = {w1 wl} is a set of hyperedges [7]. An example of the graph model is demonstrated on fig.…”

Section: Graph-matching Approach For Hp-graphsmentioning

confidence: 99%

“…The hyperedge w2 defines a set Ew 2 = {(p4, p8), (p4, p6), (p6, p8)}. Every vertex and hyperedge can also be decomposed by a new HP-graph, which is described in detail in [7].…”

Section: Graph-matching Approach For Hp-graphsmentioning

confidence: 99%

“…and meets the condition (1) to make transformation operations possible [7]. A subgraph can contain vertices called incomplete whose sets of poles are only part of the sets of poles of the vertices of the original graph:…”

Section: Definitions Of a Subgraph And Isomorphismmentioning

confidence: 99%

“…Visual languages can be represented as various types of graphs, including oriented graphs [2], hypergraphs [3], hi-graphs [4], meta-graphs [5] and P-graphs [6]. Previously, a new graph model, called HP-graph, was proposed as a formalism for representing visual languages [7]. This model unites expressive possibilities of all the mentioned graph types and, thus, it can be used for building more complicated models than those which can be built with the help of the other graph models.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

A Multilayer Approach to Subgraph Matching in HP-graphs

Suvorov¹,

Lyadova²

2021

Proceedings of ISP RAS

Self Cite

View full text Add to dashboard Cite

Visual modeling is widely used nowadays, but the existing modeling platforms cannot meet all the user requirements. Visual languages are usually based on graph models, but the graph types used have significant restrictions. A new graph model, called HP-graph, whose main element is a set of poles, the subsets of which are combined into vertices and edges, has been previously presented to solve the problem of insufficient expressiveness of the existing graph models. Transformations and many other operations on visual models face a problem of subgraph matching, which slows down their execution. A multilayer approach to subgraph matching can be a solution for this problem if a modeling system is based on the HP-graph. In this case, the search is started on the higher level of the graph model, where vertices and hyperedges are compared without revealing their structures, and only when a candidate is found, it moves to the level of poles, where the comparison of the decomposed structures is performed. The description of the idea of the multilayer approach is given. A backtracking algorithm based on this approach is presented. The Ullmann algorithm and VF2 are adapted to this approach and are analyzed for complexity. The proposed approach incrementally decreases the search field of the backtracking algorithm and helps to decrease its overall complexity. The paper proves that the existing subgraph matching algorithms except ones that modify a graph pattern can be successfully adapted to the proposed approach.

show abstract

Section: Introductionmentioning

confidence: 92%

Section: Graph-matching Approach For Hp-graphsmentioning

confidence: 99%

“…The hyperedge w2 defines a set Ew 2 = {(p4, p8), (p4, p6), (p6, p8)}. Every vertex and hyperedge can also be decomposed by a new HP-graph, which is described in detail in [7].…”

Section: Graph-matching Approach For Hp-graphsmentioning

confidence: 99%

Section: Definitions Of a Subgraph And Isomorphismmentioning

confidence: 99%