An Algorithm for Subgraph Isomorphism
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Nearly exact mining of frequent trees in large networks
- Cryptanalysis of the binary permuted kernel problem
- Approximating the minimum hub cover problem on planar graphs
- THE CHARACTERIZATION OF BINARY RELATION HOMOMORPHISMS
- A distance measure for large graphs based on prime graphs
- Multilevel coupled model transformations for precise and reusable definition of model behaviour
- Spatial arrangement of color in retrieval by visual similarity
- Graph matching using the interference of continuous-time quantum walks
- Graph matching beyond perfectly-overlapping Erdős--Rényi random graphs
- An approach for approximate subgraph matching in fuzzy RDF graph
- A similarity measure for graphs with low computational complexity
- The secret life of keys: on the calculation of mechanical lock systems
- A parametric filtering algorithm for the graph isomorphism problem
- An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants
- Graph sampling with applications to estimating the number of pattern embeddings and the parameters of a statistical relational model
- A matching algorithm between precursory 3D process model and 2D working procedure drawing based on subgraph isomorphism
- Quotient geometric crossovers and redundant encodings
- Subgraph-indexed sequential subdivision for continuous subgraph matching on dynamic knowledge graph
- Algorithm for cataloging topologies in the common information model (CIM)
- On the coding of ordered graphs
- Fifty years of graph matching, network alignment and network comparison
- The \(H_0\) function, a new index for detecting structural/topological complexity information in undirected graphs
- Privacy-preserving subgraph matching protocol for two parties
- Matching graphs with unique node labels
- No easy puzzles: hardness results for jigsaw puzzles
- Fast detection of common sequence structure patterns in RNAs
- GPDOF — A FAST ALGORITHM TO DECOMPOSE UNDER-CONSTRAINED GEOMETRIC CONSTRAINT SYSTEMS: APPLICATION TO 3D MODELING
- Comparing large graphs efficiently by margins of feature vectors
- Counting Small Induced Subgraphs Satisfying Monotone Properties
- Fast processing of graph queries on a large database of small and medium-sized data graphs
- Strong simulation: capturing topology in graph pattern matching
- Algorithms for finding directed graph isomorphisms by finite automata
- Speeding-up structured probabilistic inference using pattern mining
- Efficient Suboptimal Graph Isomorphism
- Subgraph nomination: query by example subgraph retrieval in networks
- Temporal subgraph matching method for multi-connected temporal graph
- An inductive characterization of matching in binding bigraphs
- Lower bounds for subgraph detection in the CONGEST model
- A new algorithm for digraph isomorphism
- Solving subgraph isomorphism problems with constraint programming
- Time windowed data structures for graphs
- Unification theory
- Parallel algorithms for flexible pattern matching on big graphs
- Lattice complete graphs
- The applications of object migration automaton (OMA)-memetic algorithm for solving NP-hard problems
- Maximum common induced subgraph parameterized by vertex cover
- Graph similarity scoring and matching
- Procedures for the bin packing problem with precedence constraints
- Generalized median graphs and applications
- A novel algorithm for macromolecular epitope matching
- Detecting and counting small subgraphs, and evaluating a parameterized Tutte polynomial: lower bounds via toroidal grids and Cayley graph expanders
- AllDifferent-based filtering for subgraph isomorphism
- Answering ``why empty? and ``why so many? queries in graph databases
- Algorithms for approximate graph matching
- Equivalent transformations in one class of recognition systems
- InfMatch: finding isomorphism subgraph on a big target graph based on the importance of vertex
- A fast discovery algorithm for large common connected induced subgraphs
- Correct filtering for subgraph isomorphism search in compressed vertex-labeled graphs
- Probabilistic and exact frequent subtree mining in graphs beyond forests
- Combining Two Structured Domains for Modeling Various Graph Matching Problems
- Kronecker product graph matching.
- On the complexity of concurrent multiset rewriting
- Partition search for non-binary constraint satisfaction
- SQBC: an efficient subgraph matching method over large and dense graphs
- An algorithm for weighted sub-graph matching based on gradient flows
- Approximation of graph edit distance based on Hausdorff matching
- Efficient subgraph matching using topological node feature constraints
- A fast projected fixed-point algorithm for large graph matching
- Multi-objective optimization model and evolutional solution of network node matching problem
- Hybrid search plan generation for generalized graph pattern matching
- Filtering for Subgraph Isomorphism
- The graph-bin packing problem
- Efficient graph automorphism by vertex partitioning
- Subgraph matching on temporal graphs
- Material symmetry to partition endgame tables
- SLF: a passive parallelization of subgraph isomorphism
- Size-fixed group discovery via multi-constrained graph pattern matching
- Strategic port graph rewriting: an interactive modelling framework
- SPECTRUM BASED TECHNIQUES FOR GRAPH ISOMORPHISM
- scientific article; zbMATH DE number 7622441 (Why is no real title available?)
- Isomorphism identification of graphs: especially for the graphs of kinematic chains
- A long trip in the charming world of graphs for pattern recognition
- Parameterized Counting and Cayley Graph Expanders
- Relational consistency algorithms and their application in finding subgraph and graph isomorphisms
- Bigraphs with sharing
- String diagram rewrite theory II: Rewriting with symmetric monoidal structure
- State Isomorphism in Model Programs with Abstract Data Structures
- Video indexing and similarity retrieval by largest common subgraph detection using decision trees
- Isomorphism testing via polynomial-time graph extensions
- Partial retrieval of CAD models based on the gradient flows in Lie group
- Filtering graphs to check isomorphism and extracting mapping by using the conductance electrical model
- Counting subgraphs in relational event graphs
- G-Morph: induced subgraph isomorphism search of labeled graphs on a GPU
- Efficient algorithms for supergraph query processing on graph databases
- Matching of bigraphs
- A convex relaxation bound for subgraph isomorphism
- VF2++ -- an improved subgraph isomorphism algorithm
- The gold partition conjecture for 6-thin posets
- Simulation relations for pattern matching in directed graphs
- A comparative analysis of multidimensional features of objects resembling sets of graphs
This page was built for publication: An Algorithm for Subgraph Isomorphism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4085764)
