A parallel algorithm for finding a maximum clique of a set of circular arcs of a circle
From MaRDI portal
Publication:911283
DOI10.1016/0020-0190(90)90128-KzbMath0696.68061OpenAlexW2069250795MaRDI QIDQ911283
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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
A parallel algorithm for solving the coloring problem on trapezoid graphs ⋮ Distributed algorithms for maximum cliques ⋮ AN IMPROVED PARALLEL ALGORITHM FOR A GEOMETRIC MATCHING PROBLEM WITH APPLICATION TO TRAPEZOID GRAPHS
Cites Work
- Unnamed Item
- Unnamed Item
- Finding maximum cliques on circular-arc graphs
- An improved parallel algorithm that computes the BFS numbering of a directed graph
- Preserving order in a forest in less than logarithmic time and linear space
- Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs
- Algorithms on circular-arc graphs
- Design and implementation of an efficient priority queue
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
This page was built for publication: A parallel algorithm for finding a maximum clique of a set of circular arcs of a circle
