A framework for scalable greedy coloring on distributed-memory parallel computers-Reference-Cited by-同舟云学术

A framework for scalable greedy coloring on distributed-memory parallel computers

Published:2008-04 Issue:4 Volume:68 Page:515-535
ISSN:0743-7315
Container-title:Journal of Parallel and Distributed Computing
language:en
Short-container-title:Journal of Parallel and Distributed Computing

Author:

Bozdağ Doruk,Gebremedhin Assefaw H.,Manne Fredrik,Boman Erik G.,Catalyurek Umit V.

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference32 articles.

1. J. Allwright, R. Bordawekar, P.D. Coddington, K. Dincer, C. Martin, A comparison of parallel graph coloring algorithms, Technical Report, NPAC Technical Report, SCCS-666, Northeast Parallel Architectures Center at Syracuse University, 1994.

2. Complexity and Approximation;Ausiello,1999

3. R.H. Bisseling, Parallel Scientific Computation: A Structured Approach Using BSP and MPI, Oxford, 2004.

4. A scalable parallel graph coloring algorithm for distributed memory computers;Boman,2005

5. A parallel distance-2 graph coloring algorithm for distributed memory computers;Bozdağ,2005

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

1. An Assessment of the Laminar Hypersonic Double-Cone Experiments in the LENS-XX Tunnel;AIAA Journal;2023-08

2. A new distributed graph coloring algorithm for large graphs;Cluster Computing;2023-03-23

3. An Assessment of the Laminar Hypersonic Double-Cone Experiments in the LENS-XX Tunnel;AIAA SCITECH 2023 Forum;2023-01-19

4. Parallel Vertex Color Update on Large Dynamic Networks;2022 IEEE 29th International Conference on High Performance Computing, Data, and Analytics (HiPC);2022-12

5. Clustering Models Based on Graph Edge Coloring;Journal of Communications Technology and Electronics;2022-12