A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
A Maximum Weight Clique Algorithm For Dense Circle Graphs With Many Shared Endpoints
2017
Journal of Graph Algorithms and Applications
Circle graphs are derived from the intersections of a set of chords. They have applications in VLSI design, bioinformatics, and chemistry. Some intractable problems on general graphs can be solved in polynomial time on circle graphs. As such, the study of circle graph algorithms has received attention. State-of-the-art algorithms for finding the maximum weight clique of a circle graph are very efficient when the graph is sparse. However, these algorithms require Θ(n 2 ) time when the graph is
doi:10.7155/jgaa.00428
fatcat:mezy4r3vwzds7o5tin7fnwcprq