Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs (Q5301407)
From MaRDI portal
scientific article; zbMATH DE number 5493575
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs |
scientific article; zbMATH DE number 5493575 |
Statements
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs (English)
0 references
19 January 2009
0 references
graph matching algorithms
0 references
