Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs (Q5301407): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q115926079, #quickstatements; #temporary_batch_1712261475387 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2168933917 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q115926079 / rank | |||
Normal rank | |||
Latest revision as of 23:42, 4 April 2024
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
