Temporal Network Optimization Subject to Connectivity Constraints-Reference-Cited by-同舟云学术

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

Temporal Network Optimization Subject to Connectivity Constraints

Published:2018-07-05 Issue:4 Volume:81 Page:1416-1449
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Mertzios George B.,Michail Othon,Spirakis Paul G.

Funder

Engineering and Physical Sciences Research Council

“ARISTEIA”, European Union and Greek National Resources

MULTIPLEX - Future Emerging Technologies - European Union

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00453-018-0478-6.pdf

Reference28 articles.

1. Alimonti, P., Kann, V.: Hardness of approximating problems on cubic graphs. In: Proceedings of the Third Italian Conference on Algorithms and Complexity (CIAC), pp. 288–298 (1997)

2. Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distrib. Comput. 18, 235–253 (2006)

3. Avin, C., Koucký, M., Lotker, Z.: How to explore a fast-changing world (cover time of a simple random walk on evolving graphs). In: Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP), Part I, pp. 121–132. Springer (2008)

4. Berman, K.A.: Vulnerability of scheduled networks and a generalization of Menger’s theorem. Networks 28(3), 125–134 (1996)

5. Bollobás, B.: Modern Graph Theory, corrected edn. Springer, New York (1998)

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

1. The complexity of computing optimum labelings for temporal connectivity;Journal of Computer and System Sciences;2024-12

2. Snapshot disjointness in temporal graphs;Theoretical Computer Science;2024-09

3. Temporal reachability minimization: Delaying vs. deleting;Journal of Computer and System Sciences;2024-09

4. Cluster Editing for Multi-Layer and Temporal Graphs;Theory of Computing Systems;2024-07-03

5. Blackout-tolerant temporal spanners;Journal of Computer and System Sciences;2024-05

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3