On the np-completeness of certain network testing problems (Q3315441)
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: On the np-completeness of certain network testing problems |
scientific article; zbMATH DE number 3845503
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the np-completeness of certain network testing problems |
scientific article; zbMATH DE number 3845503 |
Statements
On the np-completeness of certain network testing problems (English)
0 references
1984
0 references
undirected graph
0 references
communication network
0 references
NP-hard
0 references
maximum matching
0 references
edge coloring
0 references
0.74106764793396
0 references
0.740950882434845
0 references
0.7407299876213074
0 references
0.7407299876213074
0 references
