The minimum spanning k-core problem with bounded CVaR under probabilistic edge failures

Authors :: Ma, Juan
Pajouh, Foad Mahdavi
Balasundaram, Balabhaskar
Boginski, Vladimir
Source :: INFORMS Journal on Computing. Spring, 2016, Vol. 28 Issue 2, p295, 13 p.
Publication Year :: 2016
Abstract: This article introduces the minimum spanning k-core problem that seeks to find a spanning subgraph with a minimum degree of at least k (also known as a k-core) that minimizes [...]

Subjects :: Computer networks -- Research
Engineering research
Information networks -- Research
Graphic methods -- Analysis
Mathematical optimization -- Research
Algorithms -- Research
Algorithm
Computers
Science and technology

Full Text Access

Tools