See this document in CiteSeerX!

Parallel Algorithms for Recognizing P_5-free and ...-free Weakly Chordal Graphs  (Make Corrections)  
Stavros D. Nikolopoulos, Leonidas Palios



  Home/Search   Context   Related

 
View or download:
cs.uoi.gr/~stavros/Pa...JParP5coP5.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  cs.uoi.gr/~stavros/Papers/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: 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 graphs. (Update)

Active bibliography (related documents):   More   All
1.0:   Hole and Antihole Detection in Graphs - Stavros Nikolopoulos Leonidas (2004)   (Correct)
0.9:   Recognizing Weakly Triangulated Graphs by Edge Separability - Berry, Bordat, Heggernes (2000)   (Correct)
0.8:   Parallel Algorithms for Hamiltonian Problems on.. - Nikolopoulos   (Correct)

Similar documents based on text:   More   All
0.6:   On the Recognition of P_4-comparability Graphs - Nikolopoulos, Palios (2002)   (Correct)
0.5:   Recognizing HHD-free and Welsh-Powell Opposition Graphs - Nikolopoulos, Palios   (Correct)
0.5:   Recognition and Orientation Algorithms for P_4-comparability .. - Nikolopoulos, Palios   (Correct)

BibTeX entry:   (Update)

@misc{ nikolopoulos-parallel,
  author = "Stavros D. Nikolopoulos and Leonidas Palios",
  title = "Parallel Algorithms for Recognizing P_5-free and ...-free Weakly Chordal
    Graphs",
  url = "citeseer.ist.psu.edu/670749.html" }
Citations (may not include all citations):
488   Algorithmic Graph Theory and Perfect Graphs (context) - Golumbic - 1980
314   An Introduction to Parallel Algorithms (context) - aj - 1992
84   the desirability of acyclic database schemes (context) - Beeri, Fagin et al. - 1983
73   Triangulated graphs and the elimination process (context) - Rose - 1970
64   Department of Computer Science (context) - Lerchs, Cliques et al. - 1971
50   Weakly triangulated graphs (context) - Hayward - 1985
28   Parallel Computation: Models and Methods (context) - Akl - 1997
25   Optimizing weakly triangulated graphs (context) - Hayward, Ho et al. - 1989
18   Algorithms for weakly triangulated graphs (context) - Spinrad, Sritharan - 1995
18   Recognizing weakly triangulated graphs by edge separability - Berry, Bordat et al. - 2000
11   Weakly chordal graph algorithms via handles (context) - Hayward, Spinrad et al. - 2000
11   Perfectly ordered graphs (context) - Chv - 1984
9   Meyniel weakly triangulated graphs - I: co-perfect orderabil.. - Hayward - 1997
6   A charming class of perfectly orderable graphs (context) - Ho, Ma et al. - 1992
5   the complexity of recognizing a class of perfectly orderable.. (context) - Ho, On - 1996
4   Finding large holes (context) - Spinrad - 1991
4   Two classes of perfect graphs (context) - Hayward - 1987
4   Parallel algorithm for cograph recognition with applications - He - 1993
3   An optimal parallel co-connectivity algorithm (context) - Chong, Nikolopoulos et al.
3   An ecient algorithm for nding a two-pair (context) - Arikati, Rangan - 1991
2   Ecient parallel recognition algorithms for cographs and dist.. (context) - Dahlhaus - 1995
2   A class of perfectly orderable graphs (context) - Chv - 1989
1   th ACM-SIAM Symp (context) - Nikolopoulos, Palios et al.
1   Ecient parallel algorithms for nding chordless cycles in gra.. (context) - Chandrasekharan, Lakshmanan et al. - 1993

Documents on the same site (http://www.cs.uoi.gr/~stavros/Papers/):   More
On the Performance of the First-Fit Coloring Algorithm.. - Nikolopoulos.. (2000)   (Correct)
The Number of Spanning Trees in P4-reducible Graphs - Nikolopoulos, Papadopoulos   (Correct)
NC Coloring Algorithms for Permutation Graphs - Andreou, Nikolopoulos (1999)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC