Parallel O(log n) time edge-colouring of trees and Halin graphs-Reference-Cited by-同舟云学术

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

Parallel O(log n) time edge-colouring of trees and Halin graphs

Published:1988-02 Issue:1 Volume:27 Page:43-51
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Gibbons Alan M.,Israeli Amos,Rytter Wojciech

Publisher

Elsevier BV

Subject

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

Reference13 articles.

1. A fast parallel algorithm for six colouring of planar graphs;Diks,1986

2. On the chromatic index of outerplanar graphs;Fiorini;J. Combin. Theory Ser. B,1975

3. Edge-colouring of graphs;Fiorini,1977

4. Parallelism in random access machines;Fortune;Proc. 10th ACM Symp. on Theory of Computing,1978

5. Algorithms for edge colouring bipartite graphs and multigraphs;Gabow;SIAM J. Comput.,1982

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

1. Euler Meets GPU: Practical Graph Algorithms with Theoretical Guarantees;2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS);2021-05

2. A distributed algorithm for a maximal 2-packing set in Halin graphs;Journal of Parallel and Distributed Computing;2020-08

3. Fast parallel algorithms for the approximate edge-coloring problem;Information Processing Letters;1995-09

4. A parallel algorithm for edge-coloring of graphs with edge-disjoint cycles;Information Processing Letters;1992-10

5. Optimally edge-colouring outerplanar graphs is in NC;Theoretical Computer Science;1990-04

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP