Pages that link to "Item:Q1860118"
From MaRDI portal
The following pages link to Video indexing and similarity retrieval by largest common subgraph detection using decision trees (Q1860118):
Displaying 11 items.
- Heuristics for the generalized median graph problem (Q323345) (← links)
- Two approaches to determining similarity of two digraphs (Q395481) (← links)
- A survey of graph edit distance (Q710632) (← links)
- Finding the maximum common subgraph of a partial \(k\)-tree and a graph with a polynomially bounded number of spanning trees (Q834895) (← links)
- Kronecker product graph matching. (Q1400491) (← links)
- A polynomial-time algorithm for computing the maximum common connected edge subgraph of outerplanar graphs of bounded degree (Q1736548) (← links)
- Polyhedral study of the maximum common induced subgraph problem (Q1761750) (← links)
- A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics (Q2248525) (← links)
- Contains and inside relationships within combinatorial pyramids (Q2369579) (← links)
- A fast projected fixed-point algorithm for large graph matching (Q2417841) (← links)
- Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree (Q5859738) (← links)
