­
­
­
­

Inventi Impact: Algorithm

Articles

  • Inventi:eal/30881/20
    Algorithm for the Vertex Connectivity Problem on Circular Trapezoid Graphs
    Research 2020 : April - June
    Hirotoshi Honma, Kento Nishimura, Yuto Tamori, Yoko Nakajima

    The vertex connectivity K (G) of a graph G is the minimum number of nodes\nwhose deletion disconnects it. Graph connectivity is one of the most fundamental\nproblems in graph theory. In this paper, we designed an O (n2) time\nalgorithm to solve connectivity problem on circular trapezoid graphs.

    How to Cite this Article
    Attribution/ CC Compliant Citation: Honma, H., Nishimura, K., Tamori, Y. and Nakajima, Y. (2019) Algorithm for the Vertex\nConnectivity Problem on Circular Trapezoid Graphs. Journal of Applied Mathematics and Physics, 7, 2595-2602.\nhttps://doi.org/10.4236/jamp.2019.711177\nhttp://creativecommons.org/licenses/by/4.0/\n\nSome formatting elements, header, footer, logos, dates and pagination were modified while adapting this article.
    Download Full Text