@inproceedings{cee4a1ddde814601a64b2f20390852fe,
title = "Labeling schemes for flow and connectivity (Extended abstract)",
abstract = "This paper studies labeling schemes for flow and connectivity functions. A flow labeling scheme using O(logn · log ω)-bit labels is presented for general n-vertex graphs with maximum (integral) capacity ω. This is shown to be asymptotically optimal. For edge-connectivity, this yields a tight bound of φ(log2 n) bits. A fc-vertex connectivity labeling scheme is then given for general n-vertex graphs using at most 3 log n bits for k = 2, 5 log n bits for k = 3 and 2k log n bits for k > 3. Finally, a lower bound of Ω(klogn) is established for k-vertex connectivity on n-vertex graphs where k is polylogarithmic in n.",
author = "Michal Katz and Katz, {Nir A.} and Amos Korman and David Peleg",
year = "2002",
language = "English",
series = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",
publisher = "Association for Computing Machinery",
pages = "927--936",
booktitle = "Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002",
address = "United States",
note = "13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002 ; Conference date: 06-01-2002 Through 08-01-2002",
}