Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
55
0

Year Published

2010
2010
2019
2019

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 47 publications
(55 citation statements)
references
References 24 publications
0
55
0
Order By: Relevance
“…The BSP style gives a high-level framework for algorithmic development, which eases parallelization of irregular algorithms such as graph algorithms. Examples where this style has been employed are graph coloring [4], edge-weighted graph matching [15], and single-source shortest paths [14].…”
Section: Introductionmentioning
confidence: 99%
“…The BSP style gives a high-level framework for algorithmic development, which eases parallelization of irregular algorithms such as graph algorithms. Examples where this style has been employed are graph coloring [4], edge-weighted graph matching [15], and single-source shortest paths [14].…”
Section: Introductionmentioning
confidence: 99%
“…We additionally adapted C 2 to multithread/multicore computers. C 3 is an iterative parallel greedy coloring algorithm that was proposed by Bozdag et al [3]. Section 6 compares the impact of these graph coloring algorithms on the performance of our parallel optimization method.…”
Section: A Novel Parallel Algorithmmentioning
confidence: 99%
“…Many papers evaluate the performance of graph coloring algorithms on parallel computers [3,15,22], but their impacts on the performance of mesh optimization algorithms are rarely reported. First of all, we confirmed the performance results published in previous papers for C 1 , C 2 , and C 3 coloring algorithms.…”
Section: Influence Of Graph Coloring Algorithms On Parallel Performancementioning
confidence: 99%
“…Although this problem is NP-hard in general, there are good heuristics that provide colorings with ∆ + 1 colors, where ∆ is the maximum degree of the graph. They can be computed in parallel and in a distributed setting, see [6], and large scale tests (especially for matrix computations) show that these algorithms behave quite well in practise, see [3]. We don't think these computations will be a bottleneck for real applications of our techniques.…”
Section: Overlay Initialization and Deadlock Detectionmentioning
confidence: 99%