Fetching the paper…
Reading the bibliography…
We develop the first parallel graph coloring heuristics with strong theoretical guarantees on work and depth and coloring quality.
H. H. Seward, “Information sorting in the application of electronic digital computers to business operations,” Ph.D. dissertation, Massachusetts Institute of Technology. Department of Electrical Engineering, 1954
1954
Earlier work this paper cites.
C. A. R. Hoare, “Quicksort,” The Computer Journal , vol. 5, no. 1, pp. 10–16, 1962
1962
Earlier work this paper cites.
H. W. Lenstra and C. Pomerance, “A rigorous time bound for factoring integers,” J. Amer. Math. Soc. , vol. 5, pp. 483–516, 1962
1962
Earlier work this paper cites.
C. A. Hoare, “Quicksort,” The Computer Journal , vol. 5, no. 1, pp. 10–16, 1962
1962
Earlier work this paper cites.
P. Erdős and A. Hajnal, “On chromatic number of graphs and set-systems,” Acta Mathematica Hungarica , vol. 17, no. 1-2, pp. 61–99, 1966
1966
Earlier work this paper cites.
D. J. A. Welsh and M. B. Powell, “An upper bound for the chromatic number of a graph and its application to timetabling problems,” The Computer Journal , vol. 10, no. 1, pp. 85–86, 1967
1967
Earlier work this paper cites.
D. R. Lick and A. T. White, “k-degenerate graphs,” Canadian Journal of Mathematics , vol. 22, no. 5, p. 1082–1096, 1970
1970
Earlier work this paper cites.
D. W. Matula, G. Marble, and J. D. Isaacson, “Graph coloring algorithms,” in Graph theory and computing . Elsevier, 1972, pp. 109–122
1972
Earlier work this paper cites.
M. R. Garey, D. S. Johnson, and L. Stockmeyer, “Some simplified NP-complete problems,” in Proceedings of the sixth annual ACM symposium on Theory of computing , ser. STOC’74. ACM, 1974, pp. 47–63
1974
Earlier work this paper cites.
R. P. Brent, “The parallel evaluation of general arithmetic expressions,” Journal of the ACM (JACM) , vol. 21, no. 2, pp. 201–206, 1974
1974
Earlier work this paper cites.
R. Solovay and V. Strassen, “A fast monte-carlo test for primality,” SIAM Journal on Computing , vol. 6, no. 1, pp. 84–85, 1977
1977
Earlier work this paper cites.
D. Brélaz, “New methods to color the vertices of a graph,” Communications of the ACM , vol. 22, no. 4, 1979
1979
Earlier work this paper cites.
Ü. V. Çatalyürek, F. Dobrian, A. Gebremedhin, M. Halappanavar, and A. Pothen, “Distributed-memory parallel algorithms for matching and coloring,” in 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum . IEEE, 2011, pp. 1971–1980
1980
Earlier work this paper cites.
R. E. Ladner and M. J. Fischer, “Parallel prefix computation,” Journal of the ACM , vol. 27, no. 4, pp. 831–838, 1980
1980
Earlier work this paper cites.
D. W. Matula, Y. Shiloach, and R. E. Tarjan, “Two linear-time algorithms for five-coloring a planar graph,” STANFORD UNIV CA DEPT OF COMPUTER SCIENCE, Tech. Rep., 1980
1980
Earlier work this paper cites.
I. Holyer, “The np-completeness of edge-coloring,” SIAM Journal on computing , vol. 10, no. 4, pp. 718–720, 1981
1981
Earlier work this paper cites.
G. J. Chaitin, “Register allocation & spilling via graph coloring,” ACM Sigplan Notices , vol. 17, no. 6, pp. 98–101, 1982
1982
Earlier work this paper cites.
E. C. Freuder, “A sufficient condition for backtrack-free search,” Journal of the ACM (JACM) , vol. 29, no. 1, pp. 24–32, 1982
1982
Earlier work this paper cites.
T. F. Coleman and J. J. Moré, “Estimation of sparse jacobian matrices and graph coloring problems,” SIAM Journal on Numerical Analysis , vol. 20, no. 1, pp. 187–209, 1983
1983
Earlier work this paper cites.
D. W. Matula and L. L. Beck, “Smallest-last ordering and clustering and graph coloring algorithms,” Journal of the ACM , vol. 30, no. 3, pp. 417–427, 1983
1983
Earlier work this paper cites.
S. B. Seidman, “Network structure and minimum degree,” Social networks , vol. 5, no. 3, pp. 269–287, 1983
1983
Earlier work this paper cites.
R. M. Karp and W. Avi, “A fast parallel algorithm for the maximal independent set problem,” JACM , vol. 32, no. 4, pp. 762–773, 1985
1985
Earlier work this paper cites.
M. Luby, “A simple parallel algorithm for the maximal independent set problem,” SIAM journal on computing , vol. 15, no. 4, pp. 1036–1053, 1986
1986
Earlier work this paper cites.
N. Alon, L. Babai, and I. Alon, “A fast and simple randomized parallel algorithm for the maximal independent set problem,” Journal of Algorithms , vol. 7, no. 4, pp. 567–583, 1986
1986
Earlier work this paper cites.
K. Diks, “A fast parallel algorithm for six-colouring of planar graphs,” in International Symposium on Mathematical Foundations of Computer Science . Springer, 1986, pp. 273–282
1986
Earlier work this paper cites.
E. M. Arkin and E. B. Silverberg, “Scheduling jobs with fixed start and end times,” Discrete Applied Mathematics , vol. 18, no. 1, pp. 1–8, 1987
1987
Earlier work this paper cites.
A. V. Goldberg and S. A. Plotkin, “Parallel ( Δ + 1 \Delta+1 )-coloring of constant-degree graphs,” Information Processing Letters , vol. 25, no. 4, pp. 341–345, 1987
1987
Earlier work this paper cites.
A. Goldberg, S. Plotkin, and G. Shannon, “Parallel symmetry-breaking in sparse graphs,” in Proceedings of the nineteenth annual ACM symposium on Theory of computing , ser. STOC ’87. ACM, 1987, pp. 315–324
1987
Earlier work this paper cites.
N. Linial, “Distributive graph algorithms global solutions from local data,” in 28th Annual Symposium on Foundations of Computer Science (sfcs 1987) , 1987, pp. 331–335
1987
Earlier work this paper cites.
J. F. Boyar and H. J. Karloff, “Coloring planar graphs in parallel,” Journal of Algorithms , vol. 8, no. 4, pp. 470–479, 1987
1987
Earlier work this paper cites.
R. Ramaswami and K. Parhi, “Distributed scheduling of broadcasts in a radio network,” in Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies , ser. IEEE INFOCOM ’89. IEEE, 1989
1989
Earlier work this paper cites.
A. Aggarwal, A. K. Chandra, and M. Snir, “On communication latency in pram computations,” in Proceedings of the first annual ACM symposium on Parallel algorithms and architectures , 1989, pp. 11–21
1989
Earlier work this paper cites.
M. Goldberg and S. Thomas, “A new parallel algorithm for the maximal independent set problem ,” SIAM journal on coputing , vol. 18, no. 2, pp. 419–427, 1989
1989
Earlier work this paper cites.
T. Hagerup, M. Chrobak, and K. Diks, “Optimal parallel 5-colouring of planar graphs,” SIAM Journal on Computing , vol. 18, no. 2, pp. 288–300, 1989
1989
Earlier work this paper cites.
M. Chrobak and D. Eppstein, “Planar orientations with low out-degree and compaction of adjacency matrices,” Theoretical Computer Science , vol. 86, no. 2, pp. 243–266, 1991
1991
Earlier work this paper cites.
H. Gazit, “An optimal randomized parallel algorithm for finding connected components in a graph,” SIAM Journal on Computing , vol. 20, no. 6, pp. 1046–1067, 1991
1991
Earlier work this paper cites.
——, “Locality in distributed graph algorithms,” SIAM Journal on Computing , vol. 21, no. 1, pp. 193–201, 1992
1992
Earlier work this paper cites.
A. Panconesi and A. Srinivasan, “Improved distributed algorithms for coloring and network decomposition problems,” in Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing , ser. STOC ’92. New York, NY, USA: ACMy, 1992, p. 581–592
1992
Earlier work this paper cites.
J. Culberson, “Iterated greedy graph coloring and the difficulty landscape,” 1992
1992
Earlier work this paper cites.
M. T. Jones and P. E. Plassmann, “A parallel graph coloring heuristic,” SIAM Journal on Scientific Computing , vol. 14, no. 3, pp. 654–669, 1993
1993
Earlier work this paper cites.
F. E. Fich, The complexity of computation on the parallel random access machine . Department of Computer Science, University of Toronto, 1993
1993
Earlier work this paper cites.
M. Luby, “Removing randomness in parallel computation without a processor penalty,” Journal of Computer and System Sciences , vol. 74, no. 2, pp. 250–286, 1993
1993
Earlier work this paper cites.
P. M. McIlroy, K. Bostic, and M. D. McIlroy, “Engineering radix sort,” Computing systems , vol. 6, no. 1, pp. 5–27, 1993
1993
Earlier work this paper cites.
M. T. Jones and P. E. Plassmann, “Scalable iterative solution of sparse linear systems,” Parallel Computing , vol. 20, no. 5, pp. 753–773, 1994
1994
Earlier work this paper cites.
J. Allwright, R. Bordawekar, D. Coddington, K. Dincer, and C. L. Martin, “A comparison of parallel Graph coloring algorithms,” 1995
1995
Earlier work this paper cites.
D. R. Karger, P. N. Klein, and R. E. Tarjan, “A randomized linear-time algorithm to find minimum spanning trees,” J. ACM , vol. 42, no. 2, p. 321–328, 1995
1995
Earlier work this paper cites.
L. M. Kirousis and D. M. Thilikos, “The linkage of a graph,” SIAM Journal on Computing , vol. 25, no. 3, pp. 626–647, 1996
1996
Earlier work this paper cites.
D. R. Karger and C. Stein, “A new approach to the minimum cut problem,” J. ACM , vol. 43, no. 4, p. 601–640, 1996
1996
Earlier work this paper cites.
G. E. Blelloch, “Programming parallel algorithms,” Communications of the ACM , vol. 39, no. 3, pp. 85–97, 1996
1996
Earlier work this paper cites.
M. T. Gjertsen Jr., Robert K. ane Jones and P. E. Plassmann, “Parallel heuristics for improved, balanced graph colorings,” Journal of Parallel and Distributed Computing , vol. 37, no. 2, pp. 171 – 186, 1996
1996
Earlier work this paper cites.
C. Fleurent and J. A. Ferland, “Genetic and hybrid algorithms for graph coloring,” Annals of Operations Research , vol. 63, no. 3, pp. 437–461, 1996
1996
Earlier work this paper cites.
——, “Space-efficient scheduling of multithreaded computations,” SIAM Journal on Computing , vol. 27, no. 1, pp. 202–229, 1998
1998
Earlier work this paper cites.
A. E. Eiben, J. K. Van Der Hauw, and J. I. van Hemert, “Graph coloring with adaptive evolutionary algorithms,” Journal of Heuristics , vol. 4, no. 1, pp. 25–46, 1998
1998
Earlier work this paper cites.
A.-L. Barabási and R. Albert, “Emergence of scaling in random networks,” Science , vol. 286, no. 5439, pp. 509–512, 1999. [Online]. Available: https://science.sciencemag.org/content/286/5439/509
1999
Earlier work this paper cites.
R. D. Blumofe and C. E. Leiserson, “Scheduling multithreaded computations by work stealing,” Journal of the ACM (JACM) , vol. 46, no. 5, pp. 720–748, 1999
1999
Earlier work this paper cites.
P. J. Mucci, S. Browne, C. Deane, and G. Ho, “Papi: A portable interface to hardware performance counters,” in Proceedings of the department of defense HPCMP users group conference , vol. 710, 1999
1999
Earlier work this paper cites.
Öjvind Johansson, “Simple distributed δ \delta -coloring of graphs,” Information Processing Letters , vol. 70, no. 5, pp. 229 – 232, 1999
1999
Earlier work this paper cites.
G. Li and R. Simha, “The partition coloring problem and its application to wavelength routing and assignment,” in Proceedings of the First Workshop on Optical Networks . Citeseer, 2000, p. 1
2000
Earlier work this paper cites.
A. H. Gebremedhin and F. Manne, “Scalable parallel graph coloring algorithms,” Concurrency: Practice and Experience , vol. 12, no. 12, pp. 85–120, 2000
2000
Earlier work this paper cites.
A. H. Gebremedhin, I. G. Lassous, J. Gustedt, and J. A. Telle, “Graph coloring on a coarse grained multiprocessor,” in International Workshop on Graph-Theoretic Concepts in Computer Science . Springer, 2000, pp. 184–195
2000
Earlier work this paper cites.
D. A. Grable and A. Panconesi, “Fast distributed algorithms for brooks–vizing colorings,” Journal of Algorithms , vol. 37, no. 1, pp. 85–120, 2000
2000
Earlier work this paper cites.
R. Chandra, L. Dagum, D. Kohr, R. Menon, D. Maydan, and J. McDonald, Parallel programming in OpenMP . Morgan kaufmann, 2001
2001
Earlier work this paper cites.
E. D. Dolan and J. J. Moré, “Benchmarking optimization software with performance profiles,” Mathematical programming , vol. 91, no. 2, pp. 201–213, 2002
2002
Cited alongside, same era.
A. H. Gebremedhin, F. Manne, and A. Pothen, “Parallel Distance-k Coloring Algorithms for Numerical Optimization,” in Euro-Par 2002 Parallel Processing Proceedings . Springer, Berlin, Heidelberg, 2002, pp. 912–921
2002
Cited alongside, same era.
G. D. Bader and C. W. Hogue, “An automated method for finding molecular complexes in large protein interaction networks,” BMC bioinformatics , vol. 4, no. 1, p. 2, 2003
2003
Cited alongside, same era.
D. Marx, “Graph colouring problems and their applications in scheduling,” Periodica Polytechnica Electrical Engineering (Archives) , vol. 48, no. 1-2, pp. 11–16, 2004
2004
Cited alongside, same era.
2015
Later among the works it cites.
T. Hoefler and R. Belli, “Scientific benchmarking of parallel computing systems: twelve ways to tell the masses when reporting performance results,” in Proceedings of the international conference for high performance computing, networking, storage and analysis , 2015, pp. 1–12
2015
Later among the works it cites.
M. Naumov, M. Arsaev, P. Castonguay, J. Cohen, J. Demouth, J. Eaton, S. Layton, N. Markovskiy, I. Reguly, N. Sakharnykh, V. Sellappan, and R. Strzodka, “Amgx: A library for gpu accelerated algebraic multigrid and preconditioned iterative methods,” SIAM Journal on Scientific Computing , vol. 37, no. 5, pp. 602–626, 2015
2015
Later among the works it cites.
S. Che, G. Rodgers, B. Beckmann, and S. Reinhardt, “Graph coloring on the gpu and some techniques to improve load imbalance,” in 2015 IEEE International Parallel and Distributed Processing Symposium Workshop . IEEE, 2015, pp. 610–617
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2004
Cited alongside, same era.
A. H. Gebremedhin, F. Manne, and A. Pothen, “What color is your jacobian? graph coloring for computing derivatives,” SIAM Review , vol. 47, no. 4, pp. 629–705, 2005
2005
Cited alongside, same era.
E. G. Boman, D. Bozdağ, U. Catalyurek, A. H. Gebremedhin, and F. Manne, “A scalable parallel graph coloring algorithm for distributed memory computers,” in European Conference on Parallel Processing . Springer, 2005, pp. 241–251
2005
Cited alongside, same era.
I. Finocchi, A. Panconesi, and R. Silvestri, “An experimental analysis of simple, distributed vertex coloring algorithms,” Algorithmica , vol. 41, no. 1, pp. 1–23, 2005
2005
Cited alongside, same era.
M. A. Heroux, R. A. Bartlett, V. E. Howle, R. J. Hoekstra, J. J. Hu, T. G. Kolda, R. B. Lehoucq, K. R. Long, R. P. Pawlowski, E. T. Phipps et al. , “An overview of the trilinos project,” ACM Transactions on Mathematical Software (TOMS) , vol. 31, no. 3, pp. 397–423, 2005
2005
Cited alongside, same era.
D. Gregor and A. Lumsdaine, “The parallel bgl: A generic library for distributed graphcomputations,” 2005
2005
Cited alongside, same era.
D. Bozdağ, U. Catalyurek, A. H. Gebremedhin, F. Manne, E. G. Boman, and F. Özgüner, “A parallel distance-2 graph coloring algorithm for distributed memory computers,” in International Conference on High Performance Computing and Communications . Springer, 2005, pp. 796–806
2005
Cited alongside, same era.
D. Gregor and A. Lumsdaine, “The parallel bgl: A generic library for distributed graph computations,” Parallel Object-Oriented Scientific Computing (POOSC) , vol. 2, pp. 1–18, 2005
2005
Cited alongside, same era.
2015
Later among the works it cites.
M. Naumov, P. Castonguay, and J. Cohen, “Parallel graph coloring with applications to the incomplete-lu factorization on the gpu,” Nvidia White Paper , 2015
2015
Later among the works it cites.
N. M. Gandhi and R. Misra, “Performance comparison of parallel graph coloring algorithms on bsp model using hadoop,” in 2015 International Conference on Computing, Networking and Communications (ICNC) . IEEE, 2015, pp. 110–116
2015
Later among the works it cites.
H. Lu, M. Halappanavar, D. Chavarría-Miranda, A. Gebremedhin, and A. Kalyanaraman, “Balanced coloring for parallel computing applications,” in 2015 IEEE International Parallel and Distributed Processing Symposium , 2015, pp. 7–16
2015
Later among the works it cites.
A. Verma, A. Buchanan, and S. Butenko, “Solving the maximum clique and vertex coloring problems on very large sparse networks,” INFORMS Journal on computing , vol. 27, no. 1, pp. 164–177, 2015
2015
Later among the works it cites.
M. Besta and T. Hoefler, “Accelerating irregular computations with hardware transactional memory and active messages,” in ACM HPDC , 2015
2015
Later among the works it cites.
M. Besta and T. Hoefler, “Active access: A mechanism for high-performance distributed data-centric computations,” in ACM ICS , 2015
2015
Later among the works it cites.
H. Schweizer, M. Besta, and T. Hoefler, “Evaluating the cost of atomic operations on modern architectures,” in IEEE PACT , 2015, pp. 445–456
2015
Later among the works it cites.
T. Kaler, W. Hasenplaugh, T. B. Schardl, and C. E. Leiserson, “Executing dynamic data-graph computations deterministically using chromatic scheduling,” ACM Transactions on Parallel Computing (TOPC) , vol. 3, no. 1, pp. 1–31, 2016
2016
Later among the works it cites.
M. Deveci, E. G. Boman, K. D. Devine, and S. Rajamanickam, “Parallel graph coloring for manycore architectures,” in 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS) . IEEE, 2016, pp. 892–901
2016
Later among the works it cites.
L. Barenboim, M. Elkin, S. Pettie, and J. Schneider, “The locality of distributed symmetry breaking,” Journal of the ACM , vol. 63, no. 3, 2016
2016
Later among the works it cites.
D. G. Harris, J. Schneider, and H.-H. Su, “Distributed ( δ \delta +1)-coloring in sublogarithmic rounds,” in Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing , ser. STOC ’16. New York, NY, USA: ACM, 2016, p. 465–478
2016
Later among the works it cites.
S. Sallinen, K. Iwabuchi, S. Poudel, M. Gokhale, M. Ripeanu, and R. Pearce, “Graph colouring as a challenge problem for dynamic graph processing on distributed systems,” in SC’16: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis . IEEE, 2016, pp. 347–358
2016
Later among the works it cites.
Y. Zhou, J.-K. Hao, and B. Duval, “Reinforcement learning based local search for grouping problems: A case study on graph coloring,” Expert Systems with Applications , vol. 64, pp. 412–422, 2016
2016
Later among the works it cites.
M. Farach-Colton and M.-T. Tsai, “Tight approximations of degeneracy in large graphs,” in LATIN 2016: Theoretical Informatics . Springer, 2016, pp. 429–440
2016
Later among the works it cites.
L. Thebault, “Scalable and efficient algorithms for unstructured mesh computations,” Ph.D. dissertation, 2016
2016
Later among the works it cites.
P. Schmid, M. Besta, and T. Hoefler, “High-performance distributed RMA locks,” in ACM HPDC , 2016, pp. 19–30
2016
Later among the works it cites.
M. Besta, F. Marending, E. Solomonik, and T. Hoefler, “SlimSell: A Vectorized Graph Representation for Breadth-First Search,” in Proceedings of the 31st IEEE International Parallel & Distributed Processing Symposium (IPDPS’17) . IEEE, May 2017
2017
Later among the works it cites.
E. Solomonik, M. Besta, F. Vella, and T. Hoefler, “Scaling betweenness centrality using communication-efficient sparse matrix multiplication,” in ACM/IEEE Supercomputing , 2017, p. 47
2017
Later among the works it cites.
M. Besta, M. Podstawski, L. Groner, E. Solomonik, and T. Hoefler, “To push or to pull: On reducing communication and synchronization in graph computations,” in Proceedings of the 26th International Symposium on High-Performance Parallel and Distributed Computing , 2017, pp. 93–104
2017
Later among the works it cites.
J. Malicevic, B. Lepers, and W. Zwaenepoel, “Everything you always wanted to know about multicore graph processing but were afraid to ask,” in 2017 { \{ USENIX } \} Annual Technical Conference ( { \{ USENIX } \} { \{ ATC } \} 17) , 2017, pp. 631–643
2017
Later among the works it cites.
X. Chen, P. Li, J. Fang, T. Tang, Z. Wang, and C. Yang, “Efficient and high-quality sparse graph coloring on gpus,” Concurrency and Computation: Practice and Experience , vol. 29, no. 10, p. e4064, 2017
2017
Later among the works it cites.
L. Yuan, L. Qin, X. Lin, L. Chang, and W. Zhang, “Effective and efficient dynamic graph coloring,” Proceedings of the VLDB Endowment , vol. 11, no. 3, pp. 338–351, 2017
2017
Later among the works it cites.
H. Lu, M. Halappanavar, D. Chavarría-Miranda, A. H. Gebremedhin, A. Panyala, and A. Kalyanaraman, “Algorithms for balanced graph colorings with applications in parallel computing,” IEEE Transactions on Parallel and Distributed Systems , vol. 28, no. 5, pp. 1240–1256, 2017
2017
Later among the works it cites.
J. Lin, S. Cai, C. Luo, and K. Su, “A reduction based method for coloring very large graphs.” in IJCAI , 2017, pp. 517–523
2017
Later among the works it cites.
M. Besta, S. M. Hassan, S. Yalamanchili, R. Ausavarungnirun, O. Mutlu, and T. Hoefler, “Slim noc: A low-diameter on-chip network topology for high energy efficiency and scalability,” in ACM SIGPLAN Notices , 2018
2018
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
Y.-J. Chang, W. Li, and S. Pettie, “An optimal distributed ( δ \delta +1)-coloring algorithm?” in Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing , ser. STOC 2018. ACM, 2018, p. 445–456
2018
Later among the works it cites.
L. Barenboim, M. Elkin, and U. Goldenberg, “Locally-iterative distributed ( δ \delta + 1): -coloring below szegedy-vishwanathan barrier, and applications to self-stabilization and to restricted-bandwidth models,” in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing , ser. PODC ’18. New York, NY, USA: ACM, 2018, p. 437–446
2018
Later among the works it cites.
S. Bhattacharya, D. Chakrabarty, M. Henzinger, and D. Nanongkai, “Dynamic algorithms for graph coloring,” in Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms . SIAM, 2018, pp. 1–20
2018
Later among the works it cites.
S. K. Bera and P. Ghosh, “Coloring in graph streams,” arXiv preprint arXiv:1807.07640 , 2018
2018
Later among the works it cites.
Y. Zhou, B. Duval, and J.-K. Hao, “Improving probability learning based local search for graph coloring,” Applied Soft Computing , vol. 65, pp. 542–553, 2018
2018
Later among the works it cites.
M. Besta, D. Stanojevic, T. Zivic, J. Singh, M. Hoerold, and T. Hoefler, “Log (graph) a near-optimal high-performance graph representation,” in ACM PACT , 2018, pp. 1–13
2018
Later among the works it cites.
L. Gianinazzi, P. Kalvoda, A. De Palma, M. Besta, and T. Hoefler, “Communication-avoiding parallel minimum cuts and connected components,” in ACM SIGPLAN Notices , vol. 53, no. 1. ACM, 2018, pp. 219–232
2018
Later among the works it cites.
J. S. Firoz, M. Zalewski, A. Lumsdaine, and M. Barnas, “Runtime scheduling policies for distributed graph algorithms,” in 2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS) . IEEE, 2018, pp. 640–649
2018
Later among the works it cites.
——, “Enabling highly scalable remote memory access programming with mpi-3 one sided,” Communications of the ACM , vol. 61, no. 10, pp. 106–113, 2018
2018
Later among the works it cites.
G. Kwasniewski, M. Kabić, M. Besta, J. VandeVondele, R. Solcà, and T. Hoefler, “Red-blue pebbling revisited: near optimal parallel matrix-matrix multiplication,” in Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis , 2019, pp. 1–22
2019
Later among the works it cites.
2019
Later among the works it cites.
Y.-J. Chang, T. Kopelowitz, and S. Pettie, “An exponential separation between randomized and deterministic complexity in the local model,” SIAM Journal on Computing , vol. 48, no. 1, pp. 122–143, 2019
2019
Later among the works it cites.
J. Bossek, F. Neumann, P. Peng, and D. Sudholt, “Runtime analysis of randomized search heuristics for dynamic graph coloring,” in Proceedings of the Genetic and Evolutionary Computation Conference , 2019, pp. 1443–1451
2019
Later among the works it cites.
S. Solomon and N. Wein, “Improved dynamic graph coloring,” arXiv preprint arXiv:1904.12427 , 2019
2019
Later among the works it cites.
M. Besta, M. Fischer, T. Ben-Nun, J. De Fine Licht, and T. Hoefler, “Substream-centric maximum matchings on fpga,” in ACM/SIGDA FPGA , 2019, pp. 152–161
2019
Later among the works it cites.
E. Hébrard and G. Katsirelos, “A hybrid approach for exact coloring of massive graphs,” in International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research . Springer, 2019, pp. 374–390
2019
Later among the works it cites.
2019
Later among the works it cites.
T. Ben-Nun, M. Besta, S. Huber, A. N. Ziogas, D. Peter, and T. Hoefler, “A modular benchmarking infrastructure for high-performance and reproducible deep learning,” IEEE IPDPS , 2019
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
M. Besta, S. Weber, L. Gianinazzi, R. Gerstenberger, A. Ivanov, Y. Oltchik, and T. Hoefler, “Slim graph: practical lossy graph compression for approximate graph processing, storage, and analytics,” in Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis . ACM, 2019, p. 35
2019
Later among the works it cites.
M. Besta, R. Kanakagiri, H. Mustafa, M. Karasikov, G. Rätsch, T. Hoefler, and E. Solomonik, “Communication-efficient jaccard similarity for high-performance distributed genome comparisons,” IEEE IPDPS , 2020
2020
Closest in time.
M. Besta, M. Schneider, K. Cynk, M. Konieczny, E. Henriksson, S. Di Girolamo, A. Singla, and T. Hoefler, “Fatpaths: Routing in supercomputers and data centers when shortest paths fall short,” ACM/IEEE Supercomputing , 2020
2020
Closest in time.
2020
Closest in time.
M. Javedankherad, Z. Zeinalpour-Yazdi, and F. Ashtiani, “Content placement in cache networks using graph coloring,” IEEE Systems Journal , 2020
2020
Closest in time.
L. Dhulipala, J. Shi, T. Tseng, G. E. Blelloch, and J. Shun, “The graph based benchmark suite (gbbs),” in Proceedings of the 3rd Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA) , 2020, pp. 1–8
2020
Closest in time.
G. Alabandi, E. Powers, and M. Burtscher, “Increasing the parallelism of graph coloring via shortcutting,” in Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming , 2020, pp. 262–275
2020
Closest in time.
M. Besta, M. Fischer, T. Ben-Nun, D. Stanojevic, J. D. F. Licht, and T. Hoefler, “Substream-centric maximum matchings on fpga,” ACM Transactions on Reconfigurable Technology and Systems (TRETS) , vol. 13, no. 2, pp. 1–33, 2020
2020
Closest in time.