Labeling schemes for vertex connectivity
From MaRDI portal
Publication:2930318
DOI10.1145/1721837.1721855zbMath1300.05153OpenAlexW2042604558MaRDI QIDQ2930318
No author found.
Publication date: 18 November 2014
Published in: (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1721837.1721855
No records found.
No records found.
Related Items (11)
Better distance labeling for unweighted planar graphs ⋮ A Simple and Optimal Ancestry Labeling Scheme for Trees ⋮ Adjacency Labeling Schemes and Induced-Universal Graphs ⋮ Near-optimal induced universal graphs for cycles and paths ⋮ Unnamed Item ⋮ Better distance labeling for unweighted planar graphs ⋮ Frequency assignment model of zero divisor graph ⋮ Fault-tolerant distance labeling for planar graphs ⋮ A note on labeling schemes for graph connectivity ⋮ List graphs and distance-consistent node labelings ⋮ Fault-tolerant distance labeling for planar graphs
This page was built for publication: Labeling schemes for vertex connectivity
