Author:
Katz Michal,Katz Nir A.,Peleg David
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference11 articles.
1. Coding the vertexes of a graph;Breuer;IEEE Trans. Inform. Theory,1966
2. An unexpected result on coding the vertices of a graph;Breuer;J. Math. Anal. Appl.,1967
3. Routing in trees;Fraigniaud,2001
4. A space lower bound for routing in trees;Fraigniaud,2002
5. Compact and localized distributed data structures;Gavoille;Distributed computing, PODC Jubilee Special Issue,2003
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs;Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures;2022-07-11
2. Randomized proof-labeling schemes;Distributed Computing;2018-08-30
3. Randomized Proof-Labeling Schemes;Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing;2015-07-21
4. Localized and compact data-structure for comparability graphs;Discrete Mathematics;2009-06
5. An Optimal Labeling for Node Connectivity;Algorithms and Computation;2009