A note on the derivation of maximal common subgraphs of two directed or undirected graphs

DOI10.1007/BF02575586zbMath0261.05132OpenAlexW2082403159MaRDI QIDQ2560433

Yanyan Li

Publication date: 1973

Published in: Calcolo (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02575586

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (05C99) Directed graphs (digraphs), tournaments (05C20) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items

Matching graphs with unique node labels ⋮ Quantum walk inspired algorithm for graph similarity and isomorphism ⋮ Lattice complete graphs ⋮ Applying correlation dimension to the analysis of the evolution of network structure ⋮ The graph matching problem ⋮ Maximum common induced subgraph parameterized by vertex cover ⋮ Term-Graph Anti-Unification ⋮ Listing Maximal Subgraphs Satisfying Strongly Accessible Properties ⋮ Isomorphism testing via polynomial-time graph extensions ⋮ Edit distance-based kernel functions for structural pattern classification ⋮ A fast discovery algorithm for large common connected induced subgraphs ⋮ Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms ⋮ Image matching from handcrafted to deep features: a survey ⋮ Enumerating all connected maximal common subgraphs in two graphs ⋮ Video indexing and similarity retrieval by largest common subgraph detection using decision trees ⋮ Graph Kernels: A Survey ⋮ An algorithm for reporting maximal \(c\)-cliques

Cites Work

• A note on the derivation of maximal compatibility classes
• 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 weighted graph embedding technique and its application to automatic circuit layout
• Isomorfismo fra grafi: un algoritmo efficiente per trovare tutti gli isomorfismi
• A technique for graph embedding with constraints on node and arc correspondences
• An Efficient Algorithm for Graph Isomorphism
• GIT—a heuristic program for testing pairs of directed line graphs for isomorphism