@inproceedings{cddab74b30d6429e9ecc4fce9b04f024,
title = "Labeling schemes for vertex connectivity",
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 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.",
keywords = "Graph algorithms, Labeling schemes, Vertex-connectivity",
author = "Amos Korman",
year = "2007",
doi = "10.1007/978-3-540-73420-8_11",
language = "English",
isbn = "3540734198",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "102--109",
booktitle = "Automata, Languages and Programming - 34th International Colloquium, ICALP 2007, Proceedings",
address = "Germany",
note = "34th International Colloquium on Automata, Languages and Programming, ICALP 2007 ; Conference date: 09-07-2007 Through 13-07-2007",
}