Labeling schemes for vertex connectivity

Authors:
Amos Korman
Affiliations:
CNRS and Université Paris Diderot, Paris, France
Venue:
ACM Transactions on Algorithms (TALG)
Year:
2010

Citing 21
Cited 5

Implicit representation of graphs

SIAM Journal on Discrete Mathematics
Distance labeling in graphs

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Compact labeling schemes for ancestor queries

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Compact routing schemes

Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Graph Algorithms

Graph Algorithms
Labeling dynamic XML trees

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Reachability and distance queries via 2-hop labels

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A comparison of labeling schemes for ancestor queries

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Small Induced-Universal Graphs and Compact Implicit Graph Representations

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
A Space Lower Bound for Routing in Trees

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Compact and localized distributed data structures

Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Labeling Schemes for Flow and Connectivity

SIAM Journal on Computing
Compact oracles for reachability and approximate distances in planar digraphs

Journal of the ACM (JACM)
Labeling Schemes for Small Distances in Trees

SIAM Journal on Discrete Mathematics
Compact Labeling Scheme for Ancestor Queries

SIAM Journal on Computing
Controller and estimator for dynamic networks

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
On local representation of distances in trees

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Labeling schemes for weighted dynamic trees

Information and Computation
Improved compact routing schemes for dynamic trees

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Shorter implicit representation for planar graphs and bounded treewidth graphs

ESA'07 Proceedings of the 15th annual European conference on Algorithms
Constructing labeling schemes through universal matrices

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation

An Optimal Labeling for Node Connectivity

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
An optimal ancestry scheme and small universal posets

Proceedings of the forty-second ACM symposium on Theory of computing
Compact ancestry labeling schemes for XML trees

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A note on labeling schemes for graph connectivity

Information Processing Letters
Controller and estimator for dynamic networks

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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