NP-completeness of \(k\)-connected hyperedge-replacement languages of order \(k\) (Q1209328)
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 167740
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | NP-completeness of \(k\)-connected hyperedge-replacement languages of order \(k\) |
scientific article; zbMATH DE number 167740 |
Statements
NP-completeness of \(k\)-connected hyperedge-replacement languages of order \(k\) (English)
0 references
16 May 1993
0 references
hyperedge-replacement grammars
0 references
NP-complete sets
0 references
\(k\)-connected graphs
0 references
0 references
0 references
0 references
0.8319913148880005
0 references
0.830227255821228
0 references
0.7794009447097778
0 references
0.7721046805381775
0 references
