Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming (Q1749453): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10107-018-1242-z / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2791249516 / rank | |||
Normal rank | |||
Revision as of 19:36, 19 March 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
