Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming (Q1749453): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10107-018-1242-z / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10107-018-1242-Z / rank | |||
Normal rank | |||
Latest revision as of 08:06, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming |
scientific article |
Statements
Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming (English)
0 references
16 May 2018
0 references
fault-tolerant
0 references
connectivity
0 references
DC programming
0 references
convex function
0 references
0 references
0 references
0 references
