Labeling Schemes for Flow and Connectivity,

  • Authors:

  • M. Katz;N. A. Katz;A. Korman;D. Peleg

  • Affiliations:

  • -;-;-;-

  • Venue:
  • Labeling Schemes for Flow and Connectivity,
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper studies labeling schemes for flow and connectivity functions. A flow labeling scheme using O(logn?log[^(w)])-bit labels is presented for general n-vertex graphs with maximum (integral) capacity [^(w)]. This is shown to be asymptotically optimal. For edge-connectivity, this yields a tight bound of Q(log2 n) bits. A k-vertex connectivity labeling scheme is then given for general n-vertex graphs using at most 3logn bits for k = 2, 5logn bits for k = 3 and 2klogn bits for k