Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree

Published:2018-11 Issue: Volume:139 Page:53-59
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Stokes Jonathan,Weber Steven^ORCID

Funder

National Science Foundation

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference23 articles.

1. Assortative mixing in networks;Newman;Phys. Rev. Lett.,2002

2. Quick detection of high-degree entities in large directed networks;Avrachenkov,2014

3. On random walks and random sampling to find max degree nodes in assortative Erdős Rényi graphs;Stokes,2016

4. The self-avoiding walk-jump (SAWJ) algorithm for finding maximum degree nodes in large graphs;Stokes,2016

5. Maximizing the spread of influence through a social network;Kempe,2003

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP