Scale Free Properties of Random k-Trees-Reference-Cited by-同舟云学术

Scale Free Properties of Random k-Trees

Published:2010-04-16 Issue:4 Volume:3 Page:489-496
ISSN:1661-8270
Container-title:Mathematics in Computer Science
language:en
Short-container-title:Math.Comput.Sci.

Author:

Cooper Colin,Uehara Ryuhei

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Computational Mathematics

Link

http://link.springer.com/content/pdf/10.1007/s11786-010-0041-6.pdf

Reference15 articles.

1. Barabási A.-L., Albert R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)

2. Bonato, A.: A Course on the Web Graph, American Mathematical Society Graduate Studies in Mathematics 2008, vol. 89 (2008)

3. Bodlaender H.: A tourist guide through treewidth. Acta Cybernet. 11, 1–21 (1993)

4. Bodlaender H.: A Partial k-arboretum of graphs with bounded treewidth. Theor. Comput. Sci. 209, 1–45 (1998)

5. Bollobás, B., Riordan, O.: Mathematical results on scale-free graphs. In: Bornholdt, S., Schuster, H. (eds.) Handbook of Graphs and Networks, Wiley, Berlin (2002)

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Learning Algorithms with Self-Play: A New Approach to the Distributed Directory Problem;2021 IEEE 33rd International Conference on Tools with Artificial Intelligence (ICTAI);2021-11

2. What Graph Properties Are Constant-Time Testable?;The Review of Socionetwork Strategies;2019-09-25

3. Justifying the small-world phenomenon via random recursive trees;Random Structures & Algorithms;2016-03-07

4. Randomized rumor spreading in poorly connected small-world networks;Random Structures & Algorithms;2015-11-19

5. Competitive Diffusion on Weighted Graphs;Lecture Notes in Computer Science;2015