A note on the derivation of maximal common subgraphs of two directed or undirected graphs
DOI10.1007/BF02575586zbMATH Open0261.05132OpenAlexW2082403159MaRDI QIDQ2560433FDOQ2560433
Authors: Yanyan Li 
Publication date: 1973
Published in: Calcolo (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02575586
Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (05C99) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Cites Work
- An Efficient Algorithm for Graph Isomorphism
- Isomorfismo fra grafi: un algoritmo efficiente per trovare tutti gli isomorfismi
- GIT—a heuristic program for testing pairs of directed line graphs for isomorphism
- Un metodo euristico per la verifica dell'isomorfismo di due grafi semplici non orientati. (A heuristic method for determinating the isomorphism of two simple non-oriented graphs)
- A note on the derivation of maximal compatibility classes
- A weighted graph embedding technique and its application to automatic circuit layout
- A technique for graph embedding with constraints on node and arc correspondences
Cited In (18)
- Matching graphs with unique node labels
- Applying correlation dimension to the analysis of the evolution of network structure
- Term-graph anti-unification
- Lattice complete graphs
- Maximum common induced subgraph parameterized by vertex cover
- Listing Maximal Subgraphs Satisfying Strongly Accessible Properties
- A fast discovery algorithm for large common connected induced subgraphs
- Image matching from handcrafted to deep features: a survey
- Graph kernels: a survey
- Quantum walk inspired algorithm for graph similarity and isomorphism
- Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms
- Video indexing and similarity retrieval by largest common subgraph detection using decision trees
- Isomorphism testing via polynomial-time graph extensions
- The graph matching problem
- An algorithm for reporting maximal \(c\)-cliques
- Enumerating all connected maximal common subgraphs in two graphs
- Bounds on the Twin-Width of Product Graphs
- Edit distance-based kernel functions for structural pattern classification
This page was built for publication: A note on the derivation of maximal common subgraphs of two directed or undirected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2560433)
