Subgraph isomorphism, matching relational structures and maximal cliques

DOI10.1016/0020-0190(76)90049-1MaRDI QIDQ1245239zbMATH OpenOpenAlexWikidataFDO

Authors H. G. Barrow, Rod 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

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

Cites work

• A versatile system for computer-controlled assembly
• Algorithm 457: finding all cliques of an undirected graph
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)

Cited in

(16)

• Graph matching using the interference of continuous-time quantum walks
• Spectral embedding of graphs.
• QUBO formulations for the graph isomorphism problem and related problems
• Compositional properties of alignments
• Applying correlation dimension to the analysis of the evolution of network structure
• A fast discovery algorithm for large common connected induced subgraphs
• Isomorphisms between random graphs
• On the approximability of the maximum common subgraph problem
• Lattice complete graphs
• Bounds on the Twin-Width of Product Graphs
• A convex relaxation bound for subgraph isomorphism
• Rod Burstall: in memoriam (1934--2025)
• Maximum regular induced subgraphs in 2P₃-free graphs
• Clique structure and other network properties of the tensor product of Erdős-Rényi graphs
• Algebras of binary isolating formulas for theories of modular products of graphs
• A study of graph spectra for comparing graphs and trees

Describes a project that uses

Uses Software

• Algorithm 457

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1245239)