Supermodularity in Unweighted Graph Opitimization III: Highly-connected Digraphs
Combinatorics
2017-09-05 v2 Discrete Mathematics
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 -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.
Cite
@article{arxiv.1608.05729,
title = {Supermodularity in Unweighted Graph Opitimization III: Highly-connected Digraphs},
author = {Kristóf Bérczi and András Frank},
journal= {arXiv preprint arXiv:1608.05729},
year = {2017}
}