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):
Displayed 6 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)
- Median graphs: A genetic approach based on new theoretical properties (Q2270833) (← links)
- A fast discovery algorithm for large common connected induced subgraphs (Q2274094) (← links)
- Recursive-Parallel Algorithm for Solving the Maximum Common Subgraph Problem (Q6081679) (← links)
