A note on labeling schemes for graph connectivity

DOI10.1016/j.ipl.2011.10.001zbMath1232.05203OpenAlexW2008343880MaRDI QIDQ763487

Zeev Nutov, Rani Izsak

Publication date: 9 March 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.10.001

zbMATH Keywords

data structuresgraph connectivitylabeling scheme

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Labeling schemes for dynamic tree networks
• General compact labeling schemes for dynamic trees
• Distributed verification of minimum spanning trees
• An unexpected result in coding the vertices of a graph
• An Optimal Labeling for Node Connectivity
• Implicat Representation of Graphs
• Labeling Schemes for Flow and Connectivity
• Proximity-preserving labeling schemes
• An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
• Coding the vertexes of a graph

This page was built for publication: A note on labeling schemes for graph connectivity