On the approximability of the link building problem-Reference-Cited by-同舟云学术

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

On the approximability of the link building problem

Published:2014-01 Issue: Volume:518 Page:96-116
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Olsen Martin,Viglas Anastasios

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference25 articles.

1. Maximizing PageRank with new backlinks;Olsen,2010

2. A constant-factor approximation algorithm for the link building problem;Olsen,2010

3. Get into Bed with Google;Smith,2010

4. Search Engine Optimization Bible;Ledford,2009

5. The anatomy of a large-scale hypertextual Web search engine;Brin;Computer Networks and ISDN Systems,1998

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

1. Generating Robust Counterfactual Witnesses for Graph Neural Networks;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13

2. Greedy optimization of resistance-based graph robustness with global and local edge insertions;Social Network Analysis and Mining;2023-10-12

3. Efficient Node PageRank Improvement via Link-building using Geometric Deep Learning;ACM Transactions on Knowledge Discovery from Data;2023-02-22

4. Hardness of Bounding Influence via Graph Modification;Lecture Notes in Computer Science;2023

5. On the Fixed-Parameter Tractability of the Maximum Connectivity Improvement Problem;Theory of Computing Systems;2020-04-07

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP