AnO(m+nlogn) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs
From MaRDI portal
Recommendations
- Finding maximum cliques on circular-arc graphs
- An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs
- Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs
- scientific article; zbMATH DE number 3891419
- Finding a Maximum Clique in a Set of Proper Circular Arcs in Time O(n) with Applications
Cited in
(19)- Finding maximum cliques on circular-arc graphs
- An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs
- Finding a maximum matching in a circular-arc graph
- \(k\) best cuts for circular-arc graphs
- Avoidable vertices and edges in graphs: existence, characterization, and applications
- Subgraph extraction and metaheuristics for the maximum clique problem
- Perfect circular arc coloring
- Succinct encodings for families of interval graphs
- Interval routing schemes for circular-arc graphs
- scientific article; zbMATH DE number 3891419 (Why is no real title available?)
- Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs
- Finding a Maximum Clique in a Set of Proper Circular Arcs in Time O(n) with Applications
- scientific article; zbMATH DE number 1555975 (Why is no real title available?)
- A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone
- A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs
- A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon
- Approximating minimum sum coloring with bundles
- The minimum clique routing problem on cycles
- A parallel algorithm for finding a maximum clique of a set of circular arcs of a circle
This page was built for publication: AnO(m+nlogn) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4373007)
