Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science
Reference34 articles.
1. Barenboim, L., Elkin, M.: Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition. Distrib. Comput. 22, 363–379 (2010)
2. Barenboim, L., Elkin, M., Kuhn, F.: Distributed $$(\Delta +1)$$ ( Δ + 1 ) -coloring in linear (in $$\Delta $$ Δ ) time. SIAM J. Comput. 43, 72–95 (2014)
3. Bodlaender, H., Deogun, J., Jansen, K., Kloks, T., Kratsch, D., Müller, H., Tuza, Z. (1995) Rankings of graphs. In: Graph-Theoretic Concepts in Computer Science (Lecture notes in computer science), vol. 903/1995. Springer, pp. 292–304
4. Deogun, J., Kloks, T., Kratsch, D., Müller, H. (1994) On vertex ranking for permutation and other graphs. In: Enjalbert, P., Mayr, E., Wagner, K. (eds.), Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science (Lecture notes in computer science), vol. 775. Springer, pp. 747–758
5. Dvořák, Z.: Asymptotical structure of combinatorial objects, PhD thesis, Charles University, Faculty of Mathematics and Physics (2007)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献