On the computational complexity of ordered subgraph recognition (Q4851929): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/rsa.3240070304 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1979190428 / rank | |||
Normal rank | |||
Revision as of 19:36, 19 March 2024
scientific article; zbMATH DE number 806402
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
