Pages that link to "Item:Q1245239"
From MaRDI portal
The following pages link to Subgraph isomorphism, matching relational structures and maximal cliques (Q1245239):
Displaying 11 items.
- A convex relaxation bound for subgraph isomorphism (Q666533) (← links)
- Maximum regular induced subgraphs in \(2P_3\)-free graphs (Q690473) (← links)
- A study of graph spectra for comparing graphs and trees (Q937426) (← links)
- Graph matching using the interference of continuous-time quantum walks (Q1010111) (← links)
- Spectral embedding of graphs. (Q1403778) (← links)
- QUBO formulations for the graph isomorphism problem and related problems (Q1682856) (← links)
- Compositional properties of alignments (Q2071523) (← links)
- Applying correlation dimension to the analysis of the evolution of network structure (Q2213631) (← links)
- A fast discovery algorithm for large common connected induced subgraphs (Q2274094) (← links)
- Isomorphisms between random graphs (Q2692783) (← links)
- Bounds on the Twin-Width of Product Graphs (Q6131799) (← links)
