Asset Details
Do you wish to reserve the book?
Semi-dynamic Algorithms for Strongly Chordal Graphs
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Semi-dynamic Algorithms for Strongly Chordal Graphs
Do you wish to request the book?
Semi-dynamic Algorithms for Strongly Chordal Graphs
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Paper
Semi-dynamic Algorithms for Strongly Chordal Graphs
2020
Overview
There is an extensive literature on dynamic algorithms for a large number of graph theoretic problems, particularly for all varieties of shortest path problems. Germane to this paper are a number fully dynamic algorithms that are known for chordal graphs. However, to the best of our knowledge no study has been done for the problem of dynamic algorithms for strongly chordal graphs. To address this gap, in this paper, we propose a semi-dynamic algorithm for edge-deletions and a semi-dynamic algorithm for edge-insertions in a strongly chordal graph, \\(G = (V, E)\\), on \\(n\\) vertices and \\(m\\) edges. The query complexity of an edge-deletion is \\(O(d_u^2d_v^2 (n + m))\\), where \\(d_u\\) and \\(d_v\\) are the degrees of the vertices \\(u\\) and \\(v\\) of the candidate edge \\(\\{u, v\\}\\), while the query-complexity of an edge-insertion is \\(O(n^2)\\).
Publisher
Cornell University Library, arXiv.org
Subject
