A parallel algorithm for finding a maximum clique of a set of circular arcs of a circle
From MaRDI portal
DOI10.1016/0020-0190(90)90128-KzbMATH Open0696.68061OpenAlexW2069250795MaRDI QIDQ911283FDOQ911283
Authors: Sung Kwon Kim 
Publication date: 1990
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(90)90128-k
Recommendations
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Graph theory
- Preserving order in a forest in less than logarithmic time and linear space
- Algorithms on circular-arc graphs
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Design and implementation of an efficient priority queue
- Finding maximum cliques on circular-arc graphs
- An improved parallel algorithm that computes the BFS numbering of a directed graph
- Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs
- Title not available (Why is that?)
Cited In (11)
- Finding maximum cliques on circular-arc graphs
- Parallel algorithms on circular-arc graphs
- Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search
- A parallel algorithm for solving the coloring problem on trapezoid graphs
- AN IMPROVED PARALLEL ALGORITHM FOR A GEOMETRIC MATCHING PROBLEM WITH APPLICATION TO TRAPEZOID GRAPHS
- Distributed algorithms for maximum cliques
- A parallel circle-cover minimization algorithm
- A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: A parallel algorithm for finding a maximum clique of a set of circular arcs of a circle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911283)
