The complexity of testing whether a graph is a superconcentrator (Q1162529): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/ipl/BlumKVPY81, #quickstatements; #temporary_batch_1731508824982 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/ipl/BlumKVPY81 / rank | |||
Normal rank | |||
Latest revision as of 15:54, 13 November 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
