... parallel algorithms for recognizing A-free weakly chordal graphs, a subclass of perfectly orderable graphs, and P5-free weakly chordal graphs. Our�...

We prove algorithmic characterizations of weakly chordal graphs, which lead to efficient parallel algorithms for recognizing P5-free and -free weakly�...

Abstract: We prove algorithmic characterizations of weakly chordal graphs, which lead to efficient parallel algorithms for recognizing Ps-free and Ps-free�...

Algorithmic characterizations of weakly chordal graphs are proved, which lead to efficient parallel algorithms for recognizing P5-free and ${\bar P}_5$-free�...

We prove algorithmic characterizations of weakly chordal graphs, which lead to ecient parallel algorithms for recognizing P 5 -free and P 5 -free weakly�...

We prove algorithmic characterizations of weakly chordal graphs, which lead to efficient parallel algorithms for recognizing P5-free and P̄5-free weakly�...

We prove algorithmic characterizations of weakly chordal graphs, which lead to efficient parallel algorithms for recognizing P5-free and [Formula: see�...

We prove algorithmic characterizations of weakly chordal graphs, which lead to ecient parallel algorithms for recognizing P 5 -free and P 5 -free weakly chordal�...

We prove algorithmic characterizations of weakly chordal graphs, which lead to efficient parallel algorithms for recognizing P5-free and [Formula: see�...

S.D. Nikolopoulos and L. Palios, "Parallel Algorithms for recognizing P5-free and co-P5-free Weakly Chordal Graphs," Parallel Processing Letters 14(�...