Pages that link to "Item:Q5301407"
From MaRDI portal
The following pages link to Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs (Q5301407):
Displaying 9 items.
- Heuristics for the generalized median graph problem (Q323345) (← links)
- Isomorphism testing via polynomial-time graph extensions (Q662128) (← links)
- Answering ``why empty?'' and ``why so many?'' queries in graph databases (Q891677) (← links)
- An appraisal of the performance of the MMSC subgraph generation algorithm on a Cyber system 170/720 (Q1077167) (← links)
- Video indexing and similarity retrieval by largest common subgraph detection using decision trees (Q1860118) (← links)
- Median graphs: A genetic approach based on new theoretical properties (Q2270833) (← links)
- A fast discovery algorithm for large common connected induced subgraphs (Q2274094) (← links)
- Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms (Q3627718) (← links)
- Graph-Based Representations in Pattern Recognition (Q5316471) (← links)