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 this page instead for the normal view: On the computational complexity of ordered subgraph recognition |
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
