A parallel algorithm for finding a maximum clique of a set of circular arcs of a circle

DOI10.1016/0020-0190(90)90128-KMaRDI QIDQ911283zbMATHOpenAlexFDO

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

zbMATH Keywords

parallel algorithmmaximum cliqueCREW PRAMcircular-arc graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Finding maximum cliques on circular-arc graphs
• AnO(m+nlogn) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs
• Optimal parallel algorithms on circular-arc graphs
• scientific article; zbMATH DE number 4215389
• Parallel algorithms on circular-arc graphs

Cites work

• scientific article; zbMATH DE number 4060711 (Why is no real title available?)
• Algorithms on circular-arc graphs
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• An improved parallel algorithm that computes the BFS numbering of a directed graph
• Design and implementation of an efficient priority queue
• Finding maximum cliques on circular-arc graphs
• Graph theory
• Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs
• Preserving order in a forest in less than logarithmic time and linear space

Cited in

(11)

• scientific article; zbMATH DE number 5711694 (Why is no real title available?)
• A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs
• A parallel algorithm for solving the coloring problem on trapezoid graphs
• scientific article; zbMATH DE number 1728440 (Why is no real title available?)
• scientific article; zbMATH DE number 4072403 (Why is no real title available?)
• Finding maximum cliques on circular-arc graphs
• AN IMPROVED PARALLEL ALGORITHM FOR A GEOMETRIC MATCHING PROBLEM WITH APPLICATION TO TRAPEZOID GRAPHS
• Distributed algorithms for maximum cliques
• Parallel algorithms on circular-arc graphs
• A parallel circle-cover minimization algorithm
• Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search

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)