Coding the vertexes of a graph
From MaRDI portal
Publication:5519690
DOI10.1109/TIT.1966.1053860zbMath0143.41601MaRDI QIDQ5519690
Publication date: 1966
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (19)
Average case analysis for tree labelling schemes ⋮ On Universal Graphs of Minor Closed Families ⋮ Adjacency Labeling Schemes and Induced-Universal Graphs ⋮ An adjacency labeling scheme based on a decomposition of trees into caterpillars ⋮ Proximity-preserving labeling schemes ⋮ Simple planar graph partition into three forests ⋮ Implicit representation of relations ⋮ General compact labeling schemes for dynamic trees ⋮ Compact and localized distributed data structures ⋮ Labeling schemes for weighted dynamic trees ⋮ Representing graphs implicitly using almost optimal space ⋮ Distance labeling schemes for well-separated graph classes ⋮ On induced-universal graphs for the class of bounded-degree graphs ⋮ A note on models for graph representations ⋮ An unexpected result in coding the vertices of a graph ⋮ Short Labels by Traversal and Jumping ⋮ A note on labeling schemes for graph connectivity ⋮ Informative labeling schemes for graphs ⋮ Coding the Vertices of a Graph with Rosenbloom-Tsfasman Metric
This page was built for publication: Coding the vertexes of a graph
