Serial and Parallel Algorithms for (k,2)
โ
J.A. Ellis; M. Matamontero; H. Muller
๐
Article
๐
1994
๐
Elsevier Science
๐
English
โ 693 KB
We introduce a class of layered graphs which we call \((k, 2)\) partite and which we argue are an interesting class because of several important applications. We show that testing for \((k, 2)\) partiteness can be done efficiently both on sequential and parallel machines, by showing that membership