On the np-completeness of certain network testing problems (Q3315441): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1002/net.3230140102 / rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the np-completeness of certain network testing problems / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/NET.3230140102 / rank | |||
Normal rank | |||
Latest revision as of 03:14, 21 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the np-completeness of certain network testing problems |
scientific article |
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
