An Algorithm for Subgraph Isomorphism

DOI10.1145/321921.321925zbMath0323.05138OpenAlexW2126359798WikidataQ55934414 ScholiaQ55934414MaRDI QIDQ4085764

Publication date: 1976

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321921.321925

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (05C99) Algorithms in computer science (68W99)

Related Items

The \(H_0\) function, a new index for detecting structural/topological complexity information in undirected graphs, Fast processing of graph queries on a large database of small and medium-sized data graphs, Comparing large graphs efficiently by margins of feature vectors, Partition search for non-binary constraint satisfaction, String diagram rewrite theory II: Rewriting with symmetric monoidal structure, Combining Two Structured Domains for Modeling Various Graph Matching Problems, Multi-objective optimization model and evolutional solution of network node matching problem, Procedures for the bin packing problem with precedence constraints, Matching graphs with unique node labels, Algorithms for approximate graph matching, Counting Small Induced Subgraphs Satisfying Monotone Properties, A similarity measure for graphs with low computational complexity, InfMatch: finding isomorphism subgraph on a big target graph based on the importance of vertex, Attributed relational graph matching based on the nested assignment structure, A novel algorithm for macromolecular epitope matching, An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants, An algorithm for weighted sub-graph matching based on gradient flows, Unification theory, Lower Bounds for Subgraph Detection in the CONGEST Model, Solving subgraph isomorphism problems with constraint programming, A long trip in the charming world of graphs for pattern recognition, Efficient subgraph matching using topological node feature constraints, Approximation of graph edit distance based on Hausdorff matching, Strong simulation, Simulation relations for pattern matching in directed graphs, Material Symmetry to Partition Endgame Tables, A fast projected fixed-point algorithm for large graph matching, THE GRAPH-BIN PACKING PROBLEM, Filtering graphs to check isomorphism and extracting mapping by using the conductance electrical model, Answering ``why empty? and ``why so many? queries in graph databases, Subgraph matching on temporal graphs, Relational consistency algorithms and their application in finding subgraph and graph isomorphisms, Multilevel coupled model transformations for precise and reusable definition of model behaviour, Kronecker product graph matching., A matching algorithm between precursory 3D process model and 2D working procedure drawing based on subgraph isomorphism, Probabilistic and exact frequent subtree mining in graphs beyond forests, Parallel algorithms for flexible pattern matching on big graphs, Quotient geometric crossovers and redundant encodings, An inductive characterization of matching in binding bigraphs, Parameterized Counting and Cayley Graph Expanders, Subgraph nomination: query by example subgraph retrieval in networks, Efficient algorithms for supergraph query processing on graph databases, SQBC: an efficient subgraph matching method over large and dense graphs, Nearly exact mining of frequent trees in large networks, Filtering for Subgraph Isomorphism, Lattice complete graphs, Correct filtering for subgraph isomorphism search in compressed vertex-labeled graphs, Maximum common induced subgraph parameterized by vertex cover, Strategic port graph rewriting: an interactive modelling framework, Isomorphism testing via polynomial-time graph extensions, Subgraph-indexed sequential subdivision for continuous subgraph matching on dynamic knowledge graph, Partial retrieval of CAD models based on the gradient flows in Lie group, Fast detection of common sequence structure patterns in RNAs, A convex relaxation bound for subgraph isomorphism, The gold partition conjecture for 6-thin posets, Graph sampling with applications to estimating the number of pattern embeddings and the parameters of a statistical relational model, VF2++ -- an improved subgraph isomorphism algorithm, Unnamed Item, Graph similarity scoring and matching, Fifty years of graph matching, network alignment and network comparison, A comparative analysis of multidimensional features of objects resembling sets of graphs, Isomorphism identification of graphs: especially for the graphs of kinematic chains, A distance measure for large graphs based on prime graphs, The Secret Life of Keys: On the Calculation of Mechanical Lock Systems, Algorithm for cataloging topologies in the common information model (CIM), A new algorithm for digraph isomorphism, THE CHARACTERIZATION OF BINARY RELATION HOMOMORPHISMS, Generalized median graphs and applications, A fast discovery algorithm for large common connected induced subgraphs, Algorithms for finding directed graph isomorphisms by finite automata, AllDifferent-based filtering for subgraph isomorphism, Approximating the minimum hub cover problem on planar graphs, State Isomorphism in Model Programs with Abstract Data Structures, Privacy-Preserving Subgraph Matching Protocol for Two Parties, Graph matching beyond perfectly-overlapping Erdős--Rényi random graphs, Counting Subgraphs in Relational Event Graphs, On the Complexity of Concurrent Multiset Rewriting, Graph matching using the interference of continuous-time quantum walks, On the coding of ordered graphs, A parametric filtering algorithm for the graph isomorphism problem, SPECTRUM BASED TECHNIQUES FOR GRAPH ISOMORPHISM, Efficient Suboptimal Graph Isomorphism, Equivalent transformations in one class of recognition systems, Hybrid search plan generation for generalized graph pattern matching, Efficient graph automorphism by vertex partitioning, An approach for approximate subgraph matching in fuzzy RDF graph, GPDOF — A FAST ALGORITHM TO DECOMPOSE UNDER-CONSTRAINED GEOMETRIC CONSTRAINT SYSTEMS: APPLICATION TO 3D MODELING, Time Windowed Data Structures for Graphs, Bigraphs with sharing, The Applications of Object Migration Automaton (OMA)-Memetic Algorithm for Solving NP-Hard Problems, Video indexing and similarity retrieval by largest common subgraph detection using decision trees, Matching of Bigraphs, No easy puzzles: hardness results for jigsaw puzzles, Spatial arrangement of color in retrieval by visual similarity, Speeding-up structured probabilistic inference using pattern mining, Cryptanalysis of the binary permuted kernel problem