Supermodularity in unweighted graph optimization III: Highly connected digraphs

Kristóf Bérczi, A. Frank

Research output: Contribution to journalArticle

2 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)763-780
Number of pages18
JournalMathematics of Operations Research
Issue number3
Publication statusPublished - Aug 1 2018


  • Connectivity augmentation
  • Degree-sequences
  • K-connected digraphs

ASJC Scopus subject areas

  • Mathematics(all)
  • Computer Science Applications
  • Management Science and Operations Research

Fingerprint Dive into the research topics of 'Supermodularity in unweighted graph optimization III: Highly connected digraphs'. Together they form a unique fingerprint.

  • Cite this