Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming (Q1749453): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:49, 1 February 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
