The complexity of testing whether a graph is a superconcentrator (Q1162529)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of testing whether a graph is a superconcentrator |
scientific article; zbMATH DE number 3756533
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of testing whether a graph is a superconcentrator |
scientific article; zbMATH DE number 3756533 |
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
