Parallel algorithms for parity graphs
References (10)
- et al.
A simple parallel tree contraction algorithm
J. Algorithms
(1989) - et al.
Parity graphs
Ann. Discrete Math.
(1984) The graphs whose odd cycles have at least two crossing chords
Annals of Discrete Mathematics
(1984)On the Berge conjecture concerning perfect graphs
The parallel evaluation of general arithmetic expressions
J. Assoc. Comput. Mach.
(1974)
There are more references available in the full text version of this article.
Cited by (6)
On the extension of bipartite to parity graphs
1999, Discrete Applied MathematicsAn optimal parallel matching algorithm for cographs
1994, Journal of Parallel and Distributed ComputingA new characterization for parity graphs and a coloring problem with costs
1998, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)On the equivalence in complexity among basic problems on bipartite and parity graphs
1997, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)An efficient parallel recognition algorithm of parity graphs
1993, Proceedings - ICCI 1993: 5th International Conference on Computing and Information
Copyright © 1991 Published by Elsevier Inc.