Strong Subgraph Connectivity of Digraphs: A Survey
Abstract
In this survey we overview known results on the strong subgraph k-connectivity and strong subgraph k-arc-connectivity of digraphs. After an introductory section, the paper is divided into four sections: basic results, algorithms and complexity, sharp bounds for strong subgraph k-(arc-)connectivity, minimally strong subgraph (k, )-(arc-) connected digraphs. This survey contains several conjectures and open problems for further study.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.