Pages that link to "Item:Q1245239"
From MaRDI portal
The following pages link to Subgraph isomorphism, matching relational structures and maximal cliques (Q1245239):
Displayed 7 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)
- Lattice complete graphs (Q5374007) (← links)