Acknowledgement
Supported by : Busan University of Foreign Studies
References
- M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, New York, NY: Academic Press, 1980.
- Terry. A. McKee and F. R. McMorris, Topics in Intersection Graph Theory, Philadelphia, PA: SIAM, 1999.
- M. Pal, "Intersection graphs: an introduction," Annals of Pure and Applied Mathematics, vol. 4, no. 1, pp. 43-91, Oct. 2013.
- S. Even and R. E. Tarjan, "Network flow and testing graph connectivity," SIAM Journal on Computing, vol. 4, no. 4, pp. 507-518, Oct. 1975. https://doi.org/10.1137/0204043
- P. K. Ghosh and M. Pal, "An Efficient algorithm to solve connectivity problem on trapezoid graphs," Journal of Applied Mathematics and Computing, vol. 24, no. 2, pp. 141-154, May 2007. https://doi.org/10.1007/BF02832306
- A. Ilic, "Efficient algorithm for the vertex connectivity of trapezoid graph," Information Processing Letters, vol. 113, no. 11, pp. 398-404, May 2013. https://doi.org/10.1016/j.ipl.2013.02.012
- J. H. Park, J. S. Choi and H. S. Lim, "Algorithms for finding disjoint path covers in unit interval graphs," Discrete Applied Mathematics, vol. 205, no. 1, pp. 132-149, May 2016. https://doi.org/10.1016/j.dam.2015.12.002
- S. Baswana, S. R. Chaudhury, K. Choudhary and S. Khan, "Dynamic DFS in undirected graphs: breaking the O(m) barrier," in Proceedings of the 27th annual ACM-SIAM symposium on Discrete algorithms, Virginia: VA, pp. 730-739, 2016.
- L. Roditty and U. Zwick, "A fully dynamic reachability algorithm for directed graphs with an almost linear update time," SIAM Journal on Computing, vol. 45, no. 3, pp. 712-733, Jun. 2016. https://doi.org/10.1137/13093618X
- B. M. Kapron, V. King, and B. Mountjoy, "Dynamic graph connectivity in polylogarithmic worst case time," in Proceedings of the 24th annual ACM-SIAM symposium on Discrete algorithms, Louisiana: LA, pp. 1131-1142, 2013.
- J. Holm, K. de Lichtenberg, and M. Thorup, "Polylogarithmic deterministic fully dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity," Journal of ACM, vol. 48, no. 4, pp. 723-760, Jul. 2001. https://doi.org/10.1145/502090.502095
- J. H. Kim, "Fully dynamic algorithm for the vertex connectivity of interval graphs," Journal of Korea Institute of Information and Communication Engineering, vol. 17, no. 2, pp. 399-406, Mar. 2013.
- C. Crespelle, "Fully dynamic representations of interval graphs," in Proceedings of the 35th International Workshop on Graph-Theoretic Concepts in Computer Science, France: FR, pp. 77-87, 2009.