Finding approximate patterns in undirected acyclic graphs (Q5959618): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q127065483, #quickstatements; #temporary_batch_1722702569611 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0031-3203(01)00055-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2004555680 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127065483 / rank | |||
Normal rank | |||
Latest revision as of 03:43, 4 August 2024
scientific article; zbMATH DE number 1720229
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding approximate patterns in undirected acyclic graphs |
scientific article; zbMATH DE number 1720229 |
Statements
Finding approximate patterns in undirected acyclic graphs (English)
0 references
29 September 2002
0 references
pattern matching problem
0 references
undirected acyclic graphs
0 references
