The complexity of regular subgraph recognition (Q912615)
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: The complexity of regular subgraph recognition |
scientific article; zbMATH DE number 4145327
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of regular subgraph recognition |
scientific article; zbMATH DE number 4145327 |
Statements
The complexity of regular subgraph recognition (English)
0 references
1990
0 references
regular subgraph recognition
0 references
NP-complete
0 references
0.9473957
0 references
0 references
0.9272435
0 references
0.9106994
0 references
0.90694857
0 references
0.9059823
0 references
0.90307623
0 references
