Labeling schemes for vertex connectivity

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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 l2log n on the number of bits used in a label. The best previous upper bound for the label size of such labeling scheme is 2k log n.

Original languageEnglish
Title of host publicationAutomata, Languages and Programming - 34th International Colloquium, ICALP 2007, Proceedings
PublisherSpringer Verlag
Number of pages8
ISBN (Print)3540734198, 9783540734192
StatePublished - 2007
Externally publishedYes
Event34th International Colloquium on Automata, Languages and Programming, ICALP 2007 - Wroclaw, Poland
Duration: 9 Jul 200713 Jul 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4596 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference34th International Colloquium on Automata, Languages and Programming, ICALP 2007


  • Graph algorithms
  • Labeling schemes
  • Vertex-connectivity

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Labeling schemes for vertex connectivity'. Together they form a unique fingerprint.

Cite this