Subgraph isomorphism, matching relational structures and maximal cliques

DOI10.1016/0020-0190(76)90049-1zbMATH Open0374.05043OpenAlexW2068379792WikidataQ30053698 ScholiaQ30053698MaRDI QIDQ1245239FDOQ1245239

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

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)

Cites Work

• Algorithm 457: finding all cliques of an undirected graph
• Title not available (Why is that?)
• A versatile system for computer-controlled assembly

Cited In (13)

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

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)