Distributed Data Structures: A Survey on Informative Labeling Schemes
From MaRDI portal
Publication:5756710
DOI10.1007/11821069_3zbMATH Open1132.68349OpenAlexW1540998839MaRDI QIDQ5756710
Publication date: 5 September 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11821069_3
Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Distributed algorithms (68W15)
Related Items (2)
Structural Information and Communication Complexity โฎ An efficient distributed algorithm for canonical labeling on directed split-stars
Recommendations
- Title not available (Why is that?) ๐ ๐
- An efficient distributed algorithm for canonical labeling on directed split-stars ๐ ๐
- Informative labeling schemes for graphs ๐ ๐
- Distributed graph traversals by relabelling systems with applications ๐ ๐
- Graph Labelings Derived from Models in Distributed Computing ๐ ๐
- Graph Relabelling Systems ๐ ๐
- Compact and localized distributed data structures ๐ ๐
- Structural Information and Communication Complexity ๐ ๐
- Brief Announcement: Classification of Distributed Binary Labeling Problems ๐ ๐
- Classification of distributed binary labeling problems ๐ ๐
This page was built for publication: Distributed Data Structures: A Survey on Informative Labeling Schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756710)