petsc-3.7.1 2016-05-15
Report Typos and Errors

MATCOLORINGGREEDY

Greedy-with-conflict correction based Matrix Coloring for distance 1 and 2. Many br

Notes

These algorithms proceed in two phases -- local coloring and conflict resolution. The local coloring Many brtentatively colors all vertices at the distance required given what's known of the global coloring. Then, Many brthe updated colors are transferred to different processors at distance one. In the distance one case, each Many brvertex with nonlocal neighbors is then checked to see if it conforms, with the vertex being Many brmarked for recoloring if its lower weight than its same colored neighbor. In the distance two case, Many breach boundary vertex's immediate star is checked for validity of the coloring. Lower-weight conflict Many brvertices are marked, and then the conflicts are gathered back on owning processors. In both cases Many brthis is done until each column has received a valid color. Many br

References

1. -Bozdag et al. "A Parallel Distance 2 Graph Coloring Algorithm for Distributed Memory Computers" Many brHPCC'05 Proceedings of the First international conference on High Performance Computing and Communications Many br

See Also

MatColoringCreate(), MatColoring, MatColoringSetType()

Level:beginner
Location:
src/mat/color/impls/greedy/greedy.c
Index of all MatOrderings routines
Table of Contents for all manual pages
Index of all manual pages