TY - GEN
T1 - Labeling schemes for flow and connectivity (Extended abstract)
AU - Katz, Michal
AU - Katz, Nir A.
AU - Korman, Amos
AU - Peleg, David
PY - 2002
Y1 - 2002
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84968367714&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84968367714
T3 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
SP - 927
EP - 936
BT - Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002
PB - Association for Computing Machinery
T2 - 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002
Y2 - 6 January 2002 through 8 January 2002
ER -