Labeling Schemes for Vertex Connectivity

  • Amos Korman
Conference paper

DOI: 10.1007/978-3-540-73420-8_11

Volume 4596 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Korman A. (2007) Labeling Schemes for Vertex Connectivity. In: Arge L., Cachin C., Jurdziński T., Tarlecki A. (eds) Automata, Languages and Programming. ICALP 2007. Lecture Notes in Computer Science, vol 4596. Springer, Berlin, Heidelberg

Abstract

This paper studies labeling schemes for the vertex connectivity function on general graphs. We consider the problem of labeling the nodes of any n-node graph is such a way that given the labels of two nodes u and v, one can decide whether u and v are k-vertex connected in G, i.e., whether there exist k vertex disjoint paths connecting u and v. The paper establishes an upper bound of k2logn on the number of bits used in a label. The best previous upper bound for the label size of such labeling scheme is 2klogn.

Keywords

Graph algorithms vertex-connectivity labeling schemes 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Amos Korman
    • 1
  1. 1.Information Systems Group, Faculty of IE&M, The Technion, Haifa, 32000Israel