A parallel algorithm for solving the coloring problem on trapezoid graphs
From MaRDI portal
Publication:287107
DOI10.1016/S0020-0190(97)00082-3zbMath1336.05137OpenAlexW2017354183MaRDI QIDQ287107
Shigeru Masuyama, Shin-Ichi Nakayama
Publication date: 26 May 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00082-3
Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
AN IMPROVED PARALLEL ALGORITHM FOR A GEOMETRIC MATCHING PROBLEM WITH APPLICATION TO TRAPEZOID GRAPHS
Cites Work
- A parallel algorithm for finding a maximum clique of a set of circular arcs of a circle
- Trapezoid graphs and their coloring
- A simple optimal parallel algorithm for the minimum coloring problem on interval graphs
- Parallel algorithms for permutation graphs
- Covering the vertices of a graph by vertex-disjoint paths
- Trapezoid graphs and generalizations, geometry and algorithms
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item