We present a parallel algorithm to recognize parity graphs which runs in O(log2 n) time with n 4 log 2 n processors on a CREW PRAM computer and a parallel ...
scholar.google.com › citations
Parallel Algorithms for Parity Graphs - ScienceDirect.com
www.sciencedirect.com › article › pii › pdf
In this paper we show how to use the layering structure of parity graphs to design parallel algorithms for this class of graphs. We present a parallel algorithm.
In section 4, we develop the announced efficient parallel algorithm to recognize parity graphs. ... Parity Graphs, Journal of Algorithms 12 (1991), pp. 96 ...
Parallel algorithms for geometric graph problems. In Proceedings of the forty-sixth annual ACM sympo- sium on Theory of computing, pages 574–583. ACM, 2014 ...
Parallel algorithms for parity graphs. Computing methodologies · Parallel computing methodologies · Parallel algorithms · Mathematics of computing.
A parallel algorithm is developed which recognizes parity graphs in O(log/sup 2/ n) time using a linear number of processors. This improves previous results ...
Graphs.Parallel is a module for graph algorithms that are parallelized. Their names should be consistent with the serial versions in the main module.
Missing: Parity | Show results with:Parity
Parity graphs can be recognized in linear time. We can improve the result of the parallel time bound. LEMMA 36. Let L be defined as in the parallel split ...
People also ask
What are basic parallel algorithms?
What are probabilistic parallel algorithms for sorting and selection?
What is the theory of parallel algorithms?
What are the performance measures of parallel algorithms?
In this paper we propose and evaluate a (multi-core) parallel algorithm to solve two-player parity games [27]. These games are played on a game graph, whose.
A parallel algorithm is developed which recognizes parity graphs in O(log/sup 2/ n) time using a linear number of processors. This improves previous results ...