Journal Article10.1016/S0020-0190(97)00082-3
A parallel algorithm for solving the coloring problem on trapezoid graphs
7
TL;DR: This paper proposes a parallel algorithm for solving the coloring problem on trapezoid graphs G which runs in O(log2n) time using O ( n 3 log n ) processors on the CREW PRAM where n is the number of vertices of G.
read more
About: This article is published in Information Processing Letters. The article was published on 27 Jun 1997. The article focuses on the topics: Complete coloring & Greedy coloring.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
An optimal algorithm for solving all-pairs shortest paths on trapezoid graphs
TL;DR: This paper presents an O(n2) time algorithm for solving all pairs shortest path problems on trapezoid graphs which are extensions of interval graphs and permutation graphs.
32
Optimal Sequential and Parallel Algorithms to Compute All Cut Vertices on Trapezoid Graphs
TL;DR: A sequential algorithm is presented to find all cut-vertices on trapezoid graphs using an EREW PRAM model and runs in O(n) time.
10
•Journal Article
What structural features make graph problems to have efficirnt parallel algorithms? - Using outerplanar graphs, trapezoid graphs and in-tournament graphs as examples
TL;DR: This paper analyzes what structural features of graph problems allow efficient parallel algorithms to solve typical problems on three kinds of graphs, outerplanar graphs, trapezoid graphs and in-tournament graphs.
6
An Optimal Parallel Algorithm for Finding All Hinge Vertices of a Circular-Arc Graph
Hirotoshi Honma,Shigeru Masuyama +1 more
TL;DR: This paper shall propose a parallel algorithm which runs in O( log n) time with O(n/log n) processors on EREW PRAM for finding all hinge vertices of a circular-arc graph.
3
An Optimal Parallel Algorithm for Constructing a Spanning Forest on Trapezoid Graphs
Hirotoshi Honma,Shigeru Masuyama +1 more
TL;DR: This paper presents an O(log n) time parallel algorithm with O(n/ log n) processors for constructing a spanning forest on trapezoid graph G on EREW PRAM even if G is a disconnected graph.
1
References
•Book
Graph theory with applications
J. A. Bondy
- 01 Jan 1976
TL;DR: In this paper, the authors present Graph Theory with Applications: Graph theory with applications, a collection of applications of graph theory in the field of Operational Research and Management. Journal of the Operational research Society: Vol. 28, Volume 28, issue 1, pp. 237-238.
8.8K
•Book
Algorithmic graph theory and perfect graphs
Martin Charles Golumbic
- 01 Jan 1980
TL;DR: This new Annals edition continues to convey the message that intersection graph models are a necessary and important tool for solving real-world problems and remains a stepping stone from which the reader may embark on one of many fascinating research trails.
4.3K
•Book
An introduction to parallel algorithms
Joseph JaJa
- 01 Oct 1992
TL;DR: This book provides an introduction to the design and analysis of parallel algorithms, with the emphasis on the application of the PRAM model of parallel computation, with all its variants, to algorithm analysis.