The complexity of testing whether a graph is a superconcentrator (Q1162529): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Revision as of 03:25, 5 March 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
