Implicit representation of graphs
SIAM Journal on Discrete Mathematics
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
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Graph Algorithms
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
Improved labeling scheme for ancestor queries
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
Labeling schemes for small distances in trees
SODA '03 Proceedings of the fourteenth 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
Informative Labeling Schemes for Graphs
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Short and Simple Labels for Small Distances and Other Functions
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Distance Labeling Schemes for Well-Separated Graph Classes
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects 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
Proximity-Preserving Labeling Schemes and Their Applications
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Approximate Distance Labeling Schemes
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
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)
Distributed verification of minimum spanning trees
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Labeling schemes for weighted dynamic trees
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
General compact labeling schemes for dynamic trees
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Constructing labeling schemes through universal matrices
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Coding the vertexes of a graph
IEEE Transactions on Information Theory
Controller and estimator for dynamic networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Note: A note on models for graph representations
Theoretical Computer Science
An Optimal Labeling for Node Connectivity
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Distributed approximation algorithms for finding 2-edge-connected subgraphs
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Compact separator decompositions in dynamic trees and applications to labeling schemes
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Hi-index | 0.00 |
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 k2 log 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.