Author:
Gavoille Cyril,Katz Michal,Katz Nir A.,Paul Christophe,Peleg David
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. M. A. Breuer and J. Folkman. An unexpected result on coding the vertices of a graph. J. of Mathematical Analysis and Applications, 20:583–600, 1967.
2. M. A. Breuer. Coding the vertexes of a graph. IEEE Trans. on Information Theory, IT-12:148–153, 1966.
3. D. G. Corneil, S. Olariu, and L. Stewart. Asteroidal triple-free graphs. SIAM Journal on Discrete Mathematics, 10(3):399–430, Aug. 1997.
4. P. Erdös, A. Rényi, and V. T. Sós. On a problem of graph theory. In Studia Sci. Math. Hungar., vol. 1, pp. 215–235, 1966.
5. G. N. Frederickson and R. Janardan. Efficient message routing in planar networks. SIAM Journal on Computing, 18(4):843–857, Aug. 1989.
Cited by
39 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Fault-Tolerant Distance Labeling for Planar Graphs;Structural Information and Communication Complexity;2021
2. Silent MST Approximation for Tiny Memory;Lecture Notes in Computer Science;2020
3. On the Treewidth of Planar Minor Free Graphs;Innovations and Interdisciplinary Solutions for Underserved Areas;2020
4. Distance Labeling Schemes for $$K_4$$-Free Bridged Graphs;Structural Information and Communication Complexity;2020
5. Randomized proof-labeling schemes;Distributed Computing;2018-08-30