The complexity of testing whether a graph is a superconcentrator (Q1162529): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q97309514, #quickstatements; #temporary_batch_1707232231678 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q97309514 / rank | |||
Normal rank | |||
Revision as of 17:37, 6 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of testing whether a graph is a superconcentrator |
scientific article |
Statements
The complexity of testing whether a graph is a superconcentrator (English)
0 references
1981
0 references
concentrator
0 references
superconcentrator
0 references
NP-completeness
0 references
