Subgraph matching (aka graph pattern matching or the subgraph isomorphism problem) is NP-complete. But in practice subgraph matching should be performed in reasonable time if possible. In this work a heuristically optimizing approach to subgraph matching on labeled graphs is described. It relies on the fact that the runtime of the matching process can vary significantly for different matching s...

Let ? be a finite, undirected, connected, simple graph. We say that matching M is permutable m -matching if contains edges and the subgroup of Aut ( ) fixes setwise allows to permuted in any fashion. A 2-transitive stabilizer can map ordered pair distinct other . provide constructions graphs with matching; we show that, an arc-transitive graph for ? 4 , then degree at least ; and, when sufficie...

The increasing popularity of graph data in various domains has lead to a renewed interest in developing efficient graph matching techniques, especially for processing large graphs. In this paper, we study the problem of approximate graph matching in a large attributed graph. Given a large attributed graph and a query graph, we compute a subgraph of the large graph that best matches the query gr...

With graph pattern matching the field of graph transformation (GT) includes an NP-complete subtask. But for real-live applications it is essential that graph pattern matching is performed as fast as possible. This challenge has been attacked recently by an approach we call search plan driven graph pattern matching. It has been presented independently by Batz as well as by Varró et al. However, ...