Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs

• 成果类型: Article
• 署名作者: Berczi, Kristof; Frank, Andras
• 署名单位: Eotvos Lorand University
• 刊物名称: MATHEMATICS OF OPERATIONS RESEARCH
• ISSN/ISSBN: 0364-765X
• DOI: 10.1287/moor.2017.0883
• 发表日期: 2018
• 页码: 763-780
• 关键词: directed-graphs; algorithm

摘要

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.