On the computational complexity of ordered subgraph recognition (Q4851929)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 806402
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the computational complexity of ordered subgraph recognition |
scientific article; zbMATH DE number 806402 |
Statements
On the computational complexity of ordered subgraph recognition (English)
0 references
5 March 1996
0 references
computational complexity
0 references
decision problem
0 references
0.8063485622406006
0 references
0.80632084608078
0 references
0.8057745695114136
0 references
