Subgraph isomorphism, matching relational structures and maximal cliques
From MaRDI portal
Publication:1245239
DOI10.1016/0020-0190(76)90049-1zbMath0374.05043WikidataQ30053698 ScholiaQ30053698MaRDI QIDQ1245239
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
68Q25: Analysis of algorithms and problem complexity
05C35: Extremal problems in graph theory
05C10: Planar graphs; geometric and topological aspects of graph theory
05C99: Graph theory
Related Items
On the approximability of the maximum common subgraph problem, Lattice complete graphs, A convex relaxation bound for subgraph isomorphism, Maximum regular induced subgraphs in \(2P_3\)-free graphs, A study of graph spectra for comparing graphs and trees, 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
Uses Software
Cites Work
