A note on models for graph representations

DOI10.1016/j.tcs.2008.10.036zbMath1163.68035OpenAlexW1970565536MaRDI QIDQ1008739

Amos Korman, Shay Kutten

Publication date: 30 March 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.10.036

zbMATH Keywords

distributed algorithmsdynamic networksinformative labeling schemescompact routing schemes

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items (1)

A note on models for graph representations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Labeling schemes for dynamic tree networks
• Nearest common ancestors: a survey and a new algorithm for a distributed environment
• A note on models for graph representations
• General compact labeling schemes for dynamic trees
• Distributed verification of minimum spanning trees
• D2B: A de Bruijn based content-addressable network
• Labeling schemes for weighted dynamic trees
• Resource discovery in distributed networks
• Labelling and Implicit Routing in Networks
• Compact Forbidden-Set Routing
• Interval Routing
• Implicat Representation of Graphs
• Labeling Schemes for Flow and Connectivity
• Distance labeling in graphs
• New models and algorithms for future networks
• Labeling Schemes for Vertex Connectivity
• Compact oracles for reachability and approximate distances in planar digraphs
• Routing with Improved Communication-Space Trade-Off
• Compact Labeling Scheme for Ancestor Queries
• Coding the vertexes of a graph

This page was built for publication: A note on models for graph representations