Labeling schemes for vertex connectivity

DOI10.1145/1721837.1721855MaRDI QIDQ2930318zbMATH OpenOpenAlexFDO

Authors Amos Korman

Publication date 18 November 2014

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1721837.1721855

zbMATH Keywords

graph algorithmslabeling schemesvertex-connectivity

Mathematics Subject Classification ID

Connectivity (05C40) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Labeling Schemes for Vertex Connectivity
• Labeling Schemes for Flow and Connectivity
• scientific article; zbMATH DE number 2119757
• A note on labeling schemes for graph connectivity
• An optimal labeling for node connectivity

Cited in

(22)

• Frequency assignment model of zero divisor graph
• Near-optimal induced universal graphs for cycles and paths
• A simple and optimal ancestry labeling scheme for trees
• An optimal labeling for node connectivity
• Vertex labeling and routing in self-similar outerplanar unclustered graphs modeling complex networks
• Adjacency labeling schemes and induced-universal graphs
• Labeling Schemes for Flow and Connectivity
• scientific article; zbMATH DE number 2119757 (Why is no real title available?)
• List graphs and distance-consistent node labelings
• Connectivity check in 3-connected planar graphs with obstacles
• Labeling Schemes for Vertex Connectivity
• Fault-tolerant distance labeling for planar graphs
• Fault-tolerant distance labeling for planar graphs
• scientific article; zbMATH DE number 7765385 (Why is no real title available?)
• Vertex labeling of spider graph
• Better distance labeling for unweighted planar graphs
• Space complexity of vertex connectivity oracles
• Data structures for node connectivity queries
• The structure of minimum vertex cuts
• Optimal distance labeling for permutation graphs
• A note on labeling schemes for graph connectivity
• Better distance labeling for unweighted planar graphs

This page was built for publication: Labeling schemes for vertex connectivity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2930318)