Coding the vertexes of a graph

DOI10.1109/TIT.1966.1053860MaRDI QIDQ5519690zbMATH OpenFDO

Authors Melvin A. Breuer

Publication date 1966

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.1966.1053860

zbMATH Keywords

information, communication

Cited in

(21)

• A note on models for graph representations
• Simple planar graph partition into three forests
• Distance labeling schemes for well-separated graph classes
• General compact labeling schemes for dynamic trees
• An adjacency labeling scheme based on a decomposition of trees into caterpillars
• Average case analysis for tree labelling schemes
• Labeling schemes for weighted dynamic trees
• An unexpected result in coding the vertices of a graph
• Informative labeling schemes for graphs
• Adjacency labeling schemes and induced-universal graphs
• Proximity-preserving labeling schemes
• Compact and localized distributed data structures
• On universal graphs of minor closed families
• Coding the vertices of a graph with Rosenbloom-Tsfasman metric
• Short Labels by Traversal and Jumping
• Representing graphs implicitly using almost optimal space
• Implicit representation of relations
• Distance labeling for families of cycles
• Near-optimal vertex fault-tolerant labels for Steiner connectivity
• A note on labeling schemes for graph connectivity
• On induced-universal graphs for the class of bounded-degree graphs

This page was built for publication: Coding the vertexes of a graph

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