Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming (Q1749453)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6869185
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming |
scientific article; zbMATH DE number 6869185 |
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
0.7235167026519775
0 references
0.7166580557823181
0 references
0.7081900835037231
0 references
0.708017110824585
0 references
