TR-2016-11

Supermodularity in unweighted graph optimization III: Highly connected digraphs

Kristóf Bérczi, András Frank



Abstract

By generalizing a recent result of Hong, Liu, and Lai on characterizing the degree-sequences of simple strongly connected directed graphs, a characterization is provided for degree-sequences of simple $k$-node-connected digraphs. More generally, we solve the directed node-connectivity augmentation problem when the augmented digraph is degree-specified and simple. As for edge-connectivity augmentation, we solve the special case when the edge-connectivity is to be increased by one and the augmenting digraph must be simple.


Bibtex entry:

@techreport{egres-16-11,
AUTHOR = {B{\'e}rczi, Krist{\'o}f and Frank, Andr{\'a}s},
TITLE = {Supermodularity in unweighted graph optimization III: Highly connected digraphs},
NOTE= {{\tt www.cs.elte.hu/egres}},
INSTITUTION = {Egerv{\'a}ry Research Group, Budapest},
YEAR = {2016},
NUMBER = {TR-2016-11}
}


Last modification: 5.12.2018. Please email your comments to Tamás Király!