scientific article; zbMATH DE number 17674
From MaRDI portal
Publication:3975003
Recommendations
- scientific article; zbMATH DE number 219240
- scientific article; zbMATH DE number 3935077
- scientific article; zbMATH DE number 4049082
- Removing randomness in parallel computation without a processor penalty
- Sequential and distributed graph coloring algorithms with performance analysis in random graph spaces
Cited in
(21)- A parallel variant of a heuristical algorithm for graph coloring -- corrigendum
- Removing randomness in parallel computation without a processor penalty
- A processor efficient MIS algorithm on random graphs
- Graph coloring on coarse grained multicomputers
- Coloring permutation graphs in parallel
- Parallel graph algorithms that are efficients on average
- The Parallel Complexity of Coloring Games
- Brooks Coloring in Parallel
- scientific article; zbMATH DE number 3841898 (Why is no real title available?)
- scientific article; zbMATH DE number 4049082 (Why is no real title available?)
- The greedy coloring is a bad probabilistic algorithm
- scientific article; zbMATH DE number 1241723 (Why is no real title available?)
- Parallel and On-Line Graph Coloring
- A framework for scalable greedy coloring on distributed-memory parallel computers
- scientific article; zbMATH DE number 219240 (Why is no real title available?)
- A Parallel Graph Coloring Heuristic
- scientific article; zbMATH DE number 1863545 (Why is no real title available?)
- Parallel Algorithms for Colouring Vertices of Graph Using Bit Manipulation
- Parallel vertex colouring of interval graphs
- Coloring k-colorable graphs in constant expected parallel time
- Graphs with tunable chromatic numbers for parallel coloring
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3975003)
