Fig. 1 Four chords on a circle
Fig. 2 Circle graph for four chords
Fig. 3 Connected components
Table. 1 Algorithm
References
- M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, New York, NY: Academic Press, 1980.
- X. Yang, G. M. Megson, Y. Y. Tang, and Y. Xing, "Largest connected component of a star graph with faulty vertices," International Journal of Computer Mathematics, vol. 85, no. 12, pp. 1771-1778, Oct. 2008. https://doi.org/10.1080/00207160701619200
- R. Jaberi, "On computing the 2-vertex-connected components of directed graps," Discrete Applied Mathematics, vol. 204, pp. 164-172, May 2016. https://doi.org/10.1016/j.dam.2015.10.001
- M. Henzinger, S. Krinninger, and V. Loitzenbauer, "Finding 2-edge and 2-vertex strongly connected components in quadratic time," in Proceedings of the 42h International Colloquium on Automata, Language, and Programming, pp. 713-724, 2015.
- X. Allamigeon, "On the complexity of strongly connected components in directed hypergraph," Algorithmica, vol. 69, no. 2, pp. 335-369, June 2014. https://doi.org/10.1007/s00453-012-9729-0
- A. Lulli, E. Carlini, P. Dazzi, C. Lucchese, and L. Ricci, "Fast connected components computation in large graphs by vertex pruning," International Journal of Computer Mathematics, vol. 28, no. 3, pp. 760-773, March 2017.
- S. Baswana, K. Choudhary, and L. Roditty, "An efficient strongly connected components algorithm in the fault tolerant model," in Proceedings of the 44h International Colloquium on Automata, Language, and Programming, pp. 1-15, 2017.
- J. Spinrad, "Recognition of circle graphs," Journal of Algorithms, vol. 16, no. 2, pp. 264-282, March 1994. https://doi.org/10.1006/jagm.1994.1012
- E. Gioan, C. Paul, M. Tedder, and D. Cornell, "Practical and efficient circle graph recognition," Algorithmica, vol. 69, no. 4, pp. 759-788, August 2014. https://doi.org/10.1007/s00453-013-9745-8
- A. Tiskin, "Fast distance multiplication of unit-monge matrices," Algorithmica, vol. 71, no. 4, pp. 859-888, April 2015. https://doi.org/10.1007/s00453-013-9830-z
- W. L. Hsu, "Maximum weight clique algorithms for circular-arc graphs and circle graphs," SIAM Journal of Computing, vol. 14, no. 1, pp. 224-231, March 1985. https://doi.org/10.1137/0214018
- N. Nash and D. Gregg, "An output sensitive algorithm for computing a maximum independent set of a circle graph," Information Processing Letters, vol. 110, no. 16, pp. 630-634, July 2010. https://doi.org/10.1016/j.ipl.2010.05.016