Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts

Abstract : We study the number of inclusion-minimal cuts in an undi-rected connected graph G, also called st-cuts, for any two distinct nodes s and t: the st-cuts are in one-to-one correspondence with the partitions $S ∪ T$ of the nodes of G such that $S ∩ T = ∅, s ∈ S, t ∈ T$ , and the sub-graphs induced by S and T are connected. It is easy to find an exponential upper bound to the number of st-cuts (e.g. if G is a clique) and a constant lower bound. We prove that there is a more interesting lower bound on this number, namely, $Ω(m$), for undirected m-edge graphs that are biconnected or triconnected (2-or 3-node-connected). The wheel graphs show that this lower bound is the best possible asymptotically.
Type de document :
Communication dans un congrès
WG 2018 - International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2018, Cottbus, Germany. 11159, pp.100-110, Lecture Notes in Computer Science. 〈10.1007/978-3-030-00256-5_9〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01964710
Contributeur : Marie-France Sagot <>
Soumis le : dimanche 23 décembre 2018 - 12:22:34
Dernière modification le : jeudi 7 février 2019 - 15:36:53

Fichier

main.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Takeaki Uno, et al.. Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts. WG 2018 - International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2018, Cottbus, Germany. 11159, pp.100-110, Lecture Notes in Computer Science. 〈10.1007/978-3-030-00256-5_9〉. 〈hal-01964710〉

Partager

Métriques

Consultations de la notice

5

Téléchargements de fichiers

87