The complexity of testing whether a graph is a superconcentrator (Q1162529): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q97309514, #quickstatements; #temporary_batch_1707232231678 |
Removed claims |
||
| Property / author | |||
| Property / author: Q1162527 / rank | |||
| Property / author | |||
| Property / author: Richard M. Karp / rank | |||
Revision as of 07:21, 20 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
