Addendum to: The complexity of regular subgraph recognition (Q1175798)
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 14606
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Addendum to: The complexity of regular subgraph recognition |
scientific article; zbMATH DE number 14606 |
Statements
Addendum to: The complexity of regular subgraph recognition (English)
0 references
25 June 1992
0 references
In this addendum, the authors acknowledge that some of the results from their paper [The complexity of regular subgraph recognition, Discrete Appl. Math. 27, No. 1/2, 59-68 (1990; Zbl 0698.68040)] have been published by the reviewer in 1984, see \textit{J. Plesnik} [Discrete Math. 49, 161-167 (1984; Zbl 0567.05029)].
0 references
regular subgraph
0 references
NP-complete
0 references
0.740146279335022
0 references
0.7155935764312744
0 references
0.6870977282524109
0 references
0.6846787333488464
0 references
