Parallel color-coding

Slota, George M.; Madduri, Kamesh

doi:10.1016/j.parco.2015.02.004

Title: Parallel color-coding

Full Record
Other Related Research

Authors:: Slota, George M.; Madduri, Kamesh

Publication Date:: Sat Aug 01 00:00:00 EDT 2015

Sponsoring Org.:: USDOE

OSTI Identifier:: 1253404

Resource Type:: Publisher's Accepted Manuscript

Journal Name:: Parallel Computing

Additional Journal Information:: Journal Name: Parallel Computing Journal Volume: 47 Journal Issue: C; Journal ID: ISSN 0167-8191

Publisher:: Elsevier

Country of Publication:: Netherlands

Language:: English

Citation Formats


                    Slota, George M., and Madduri, Kamesh. Parallel color-coding.  Netherlands: N. p., 2015. 
Web.  doi:10.1016/j.parco.2015.02.004.

Copy to clipboard


                    Slota, George M., & Madduri, Kamesh. Parallel color-coding.  Netherlands.  https://doi.org/10.1016/j.parco.2015.02.004

Copy to clipboard


                    Slota, George M., and Madduri, Kamesh. Sat .  
"Parallel color-coding".  Netherlands.  https://doi.org/10.1016/j.parco.2015.02.004.

Copy to clipboard


                    
@article{osti_1253404,

  title        = {Parallel color-coding},

  author       = {Slota, George M. and Madduri, Kamesh},

  abstractNote = {},

  doi          = {10.1016/j.parco.2015.02.004},

  journal      = {Parallel Computing},

  number       = C,

  volume       = 47,

  place        = {Netherlands},

  year         = {Sat Aug 01 00:00:00 EDT 2015},

  month        = {Sat Aug 01 00:00:00 EDT 2015}

}

Copy to clipboard

Journal Article:

Free Publicly Available Full Text

Accepted Manuscript (Publisher)

Publisher's Version of Record
https://doi.org/10.1016/j.parco.2015.02.004

Other availability

Search WorldCat to find libraries that may hold this journal

Citation Metrics:

Cited by: 8 works

Citation information provided by
Web of Science

Save / Share:

Export Metadata

Save to My Library

Similar Records in DOE PAGES and OSTI.GOV collections:

Fast parallel algorithms for graph-theoretic problems: matching, coloring, and partitioning

Thesis/Dissertation Karloff, H J

New parallel algorithms are presented to solve graph-theoretic problems of three kinds: matching, coloring, and partitioning. Throughout, superfast algorithms, are sought, those running on a parallel random access machine in time polynomial in the log of the input size (polylog time) and using a polynomial number of processors. Problems solvable with such algorithms are said to be in NC. Those solvable by randomized algorithms obeying the same time and processor bounds are said to be in RNC or LVNC; those in RNC (or Monte Carlo RNC) are solvable by algorithms which, on instances of size n, return a correct answermore »« less
Six-color procedure for the parallel solution of elliptic systems using the finite quadtree structures. Rept. for Mar-Nov 90

Technical Report Benantar, M ; Flaherty, J E

We consider the parallel assembly and solution on shared-memory computers of linear algebraic systems arising from the finite element discretization of two-dimensional linear self-adjoint elliptic problems. Stiffness matrix assembly and conjugate gradient solution of the linear system using element-by-element and symmetric successive over-relaxation preconditioners are processed in parallel with computations scheduled on noncontiguous regions in order to minimize process synchronization. An underlying quadtree structure, used for automatic mesh generation and solution-based mesh refinement, is separated into disjoint regions called quadrants using six-color procedure having linear time complexity.
Efficient parallel algorithms for (5+1)-coloring and maximal independent set problems

Technical Report Goldberg, A V ; Plotkin, S A

An efficient technique for breaking symmetry in parallel is described. The technique works especially well on rooted trees and on graphs with a small maximum degree. In particular, a maximal independent set can be found on a constant-degree graph in O(lg*n) time on an EREW PRAM using a linear number of processors. It is shown how to apply this technique to construct more efficient parallel algorithms for several problems, including coloring of planar graphs and (delta + 1)-coloring of constant-degree graphs. Lower bounds for two related problems are proved.
Parallel (delta + 1) coloring of constant-degree graphs

Technical Report Goldberg, A V ; Plotkin, S A

This paper presents parallel algorithms for coloring a constant-degree graph with a maximum degree of delta in (delta + 1) colors and for finding a maximal independent set in a constant-degree graph. Given a graph with n vertices, the algorithms run in O (lg*n) time on EREW PRAM with O(n) processors. The algorithms use only local communication and achieve the same complexity bounds when implemented in the distributed model of parallel computation.
Tunable color parallel tandem organic light emitting devices with carbon nanotube and metallic sheet interlayers

Journal Article Oliva, Jorge ; Desirena, Haggeo ; De la Rosa, Elder ; ... - Journal of Applied Physics

Parallel tandem organic light emitting devices (OLEDs) were fabricated with transparent multiwall carbon nanotube sheets (MWCNT) and thin metal films (Al, Ag) as interlayers. In parallel monolithic tandem architecture, the MWCNT (or metallic films) interlayers are an active electrode which injects similar charges into subunits. In the case of parallel tandems with common anode (C.A.) of this study, holes are injected into top and bottom subunits from the common interlayer electrode; whereas in the configuration of common cathode (C.C.), electrons are injected into the top and bottom subunits. Both subunits of the tandem can thus be monolithically connected functionally inmore »« less
https://doi.org/10.1063/1.4935538

Similar Records