Pages that link to "Item:Q2560433"
From MaRDI portal
The following pages link to A note on the derivation of maximal common subgraphs of two directed or undirected graphs (Q2560433):
Displayed 14 items.
- Isomorphism testing via polynomial-time graph extensions (Q662128) (← links)
- An algorithm for reporting maximal \(c\)-cliques (Q817824) (← links)
- Matching graphs with unique node labels (Q851709) (← links)
- Enumerating all connected maximal common subgraphs in two graphs (Q1589412) (← links)
- Video indexing and similarity retrieval by largest common subgraph detection using decision trees (Q1860118) (← 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)
- The graph matching problem (Q2444585) (← links)
- Maximum common induced subgraph parameterized by vertex cover (Q2445395) (← links)
- Edit distance-based kernel functions for structural pattern classification (Q2498678) (← links)
- Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms (Q3627718) (← links)
- Listing Maximal Subgraphs Satisfying Strongly Accessible Properties (Q4631095) (← links)
- (Q4993335) (← links)
- Lattice complete graphs (Q5374007) (← links)