Subgraph isomorphism, matching relational structures and maximal cliques

DOI10.1016/0020-0190(76)90049-1zbMath0374.05043OpenAlexW2068379792WikidataQ30053698 ScholiaQ30053698MaRDI QIDQ1245239

H. G. Barrow, Rod M. Burstall

Publication date: 1976

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(76)90049-1

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (05C99)

Related Items (12)

On the approximability of the maximum common subgraph problem ⋮ QUBO formulations for the graph isomorphism problem and related problems ⋮ Spectral embedding of graphs. ⋮ Isomorphisms between random graphs ⋮ Lattice complete graphs ⋮ Applying correlation dimension to the analysis of the evolution of network structure ⋮ A study of graph spectra for comparing graphs and trees ⋮ A convex relaxation bound for subgraph isomorphism ⋮ Maximum regular induced subgraphs in \(2P_3\)-free graphs ⋮ A fast discovery algorithm for large common connected induced subgraphs ⋮ Graph matching using the interference of continuous-time quantum walks ⋮ Compositional properties of alignments

Uses Software

• Algorithm 457

Cites Work

• A versatile system for computer-controlled assembly
• Algorithm 457: finding all cliques of an undirected graph
• Unnamed Item

This page was built for publication: Subgraph isomorphism, matching relational structures and maximal cliques