A Simple Greedy Algorithm for Dynamic Graph Orientation-Reference-Cited by-同舟云学术

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

A Simple Greedy Algorithm for Dynamic Graph Orientation

Published:2018-11-20 Issue:2 Volume:82 Page:245-259
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Berglin Edvin,Brodal Gerth Stølting

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-0528-0.pdf

Reference12 articles.

1. Berglin, E.: Geometric covers, graph orientations, counter games. Ph.D. thesis, Aarhus University (2017)

2. Bernstein, A., Stein, C.: Fully dynamic matching in bipartite graphs. In: International Colloquium on Automata, Languages, and Programming, pp. 167–179. Springer (2015)

3. Bernstein, A., Stein, C.: Faster fully dynamic matchings with small approximation ratios. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 692–711. Society for Industrial and Applied Mathematics (2016)

4. Brodal, G.S., Fagerberg, R.: Dynamic representation of sparse graphs. In: Proceedings 6th International Workshop on Algorithms and Data Structures (WADS), Lecture Notes in Computer Science, vol. 1663, pp. 342–351. Springer (1999)

5. Dietz, P., Sleator, D.: Two algorithms for maintaining order in a list. In: Proceedings 19th Annual ACM Symposium on Theory of Computing (STOC), pp. 365–372. ACM (1987)

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

1. NIGA: A Novel Method for Investigating the Attacker–Defender Model within Critical Infrastructure Networks;Mathematics;2024-08-16

2. On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition;SIAM Journal on Discrete Mathematics;2023-06-07

3. Parallel Batch-Dynamic Algorithms for k-Core Decomposition and Related Graph Problems;Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures;2022-07-11

4. On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition;Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing;2021-07-21

5. A Crossover Algebra for Solving Minimum Spanning Tree in Network Design with Diameter Constraints;Journal of Physics: Conference Series;2021-05-01

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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