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

A linear-time algorithm for a special case of disjoint set union

  • Published:1985-04 Issue:2 Volume:30 Page:209-221
  • ISSN:0022-0000
  • Container-title:Journal of Computer and System Sciences
  • language:en
  • Short-container-title:Journal of Computer and System Sciences

Author:

Gabow Harold N.,Tarjan Robert Endre

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference32 articles.

1. The Design and Annalysis of Computer Algorithms;Aho,1974

2. On finding lowest common ancestors in trees;Aho;SIAM J. Comput.,1976

3. A Discipline of Programming;Dijkstra,1976

4. Linear expected time of a simple union-find algorithm;Doyle;Inform. Process. Lett.,1976

5. Scheduling unit-time tasks with integer release times and deadlines;Frederickson;Inform. Process. Lett.,1983

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

1. Non-crossing shortest paths lengths in planar graphs in linear time;Discrete Applied Mathematics;2024-03

2. How vulnerable is an undirected planar graph with respect to max flow;Networks;2024-01-03

3. Partial and Simultaneous Transitive Orientations via Modular Decompositions;Algorithmica;2023-12-14

4. OOM-Guard: Towards Improving the Ergonomics of Rust OOM Handling via a Reservation-Based Approach;Proceedings of the 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering;2023-11-30

5. Finding Maximum Edge-Disjoint Paths Between Multiple Terminals;SIAM Journal on Computing;2023-10-17
同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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