Incremental graph pattern matching

DOI10.1145/2489791MaRDI QIDQ2943546zbMATH OpenOpenAlexFDO

Authors Wenfei Fan, Xin Wang, Yinghui Wu

Publication date 3 September 2015

Published in ACM Transactions on Database Systems (Search for Journal in Brave)

Full work available at URL https://www.pure.ed.ac.uk/ws/files/17626352/Fan_Wang_ET_AL_2013_Incremental_Graph_Pattern_Matching.pdf

zbMATH Keywords

subgraph isomorphismgraph pattern matchinggraph simulationincremental pattern matching

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Database theory (68P15) Algorithms on strings (68W32)

Recommendations

• Pattern graph change oriented incremental graph pattern matching
• A Benchmark Evaluation of Incremental Pattern Matching in Graph Transformation
• Graph pattern matching with expressive outerplanar graph patterns
• Efficient pattern matching on big uncertain graphs
• scientific article; zbMATH DE number 1629832
• Constraint satisfaction algorithms for graph pattern matching
• Parallel algorithms for flexible pattern matching on big graphs
• Querying regular graph patterns

Cited in

(15)

• Limited approximate bisimulations and the corresponding rough approximations
• Pattern graph change oriented incremental graph pattern matching
• A Benchmark Evaluation of Incremental Pattern Matching in Graph Transformation
• Node matching computation between two large graphs in linear computational cost
• Hybrid search plan generation for generalized graph pattern matching
• Subgraph-indexed sequential subdivision for continuous subgraph matching on dynamic knowledge graph
• Network alignment by discrete Ollivier-Ricci flow
• Linking entities across relations and graphs
• Survey on dynamic graph pattern matching technologies
• Efficient pattern matching on big uncertain graphs
• Strong simulation: capturing topology in graph pattern matching
• Host-graph-sensitive RETE nets for incremental graph pattern matching with nested graph conditions
• Discovering rare categories from graph streams
• Host-graph-sensitive RETE nets for incremental graph pattern matching
• Distributed graph pattern matching via bounded dual simulation

This page was built for publication: Incremental graph pattern matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2943546)