Keyword : in-tournament graph


What Structural Features Make Graph Problems to Have Efficient Parallel Algorithms? --Using Outerplanar Graphs, Trapezoid Graphs and In-Tournament Graphs as Examples--
Shigeru MASUYAMA Shin-ichi NAKAYAMA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2000/03/25
Vol. E83-D  No. 3 ; pp. 541-549
Type of Manuscript:  INVITED SURVEY PAPER
Category: Parallel and Distributed Algorithms
Keyword: 
parallel graph algorithmsstructure and complexityouterplanar graphtrapezoid graphin-tournament graph
 Summary | Full Text:PDF(1.1MB)