Vertex Connectivity of Graphs: Algorithms and Bounds
Kanevsky, Arkady
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/69601
Description
Title
Vertex Connectivity of Graphs: Algorithms and Bounds
Author(s)
Kanevsky, Arkady
Issue Date
1988
Doctoral Committee Chair(s)
Ramachandran, V.
Department of Study
Computer Science
Discipline
Computer Science
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Computer Science
Abstract
This thesis concerns several problems concerning vertex connectivity of undirected graphs and presents new bounds and algorithms for these problems.
We have proved that the upper bound of the number of separating triplets of a triconnected graph is ${(n - 1)(n - 4)\over 2}$, and it exactly matches the lower bound, which is achieved by the wheel graph. This result has been generalized to an $O(2\sp{k}{n\sp2 \over k})$ upper bound on the number of separating k-sets in a k-connected graph. We have also obtained a new $\Omega(2\sp{k}{n\sp2 \over k\sp2})$ lower bound.
Even though the upper bound for the number of separating k-sets is not linear but quadratic in n, we have obtained a linear representation for the separating k-sets of a k-connected graph. For $k = 3$ this representation is a collection of wheels, where every nonadjacent pair on the cycle of a wheel gives a separating triplet of a triconnected graph. For general k, we have obtained an $O(k\sp2 n)$ representation.
We have designed a new sequential $O(n\sp2)$ algorithm for the problem of determining if the graph is four-connected or not. Consequently, we find all separating triplets of the graph if it is not four-connected. The algorithm has a parallel version which runs in O(log$\sp2 n$) time using $O(n\sp2)$ processors, which is also an improvement over $O(nm)$ processor count of the best previously known parallel algorithm.
We have designed algorithms for generating all separating k-sets of a k-connected graph. The sequential algorithm runs in $O(2\sp{k}n\sp3)$ time and parallel one runs in $O(k{\rm log}n)$ deterministic parallel time or in $O({\rm log}\sp2 n)$ randomized time using $O(4\sp{k}{n\sp6 \over k\sp2})$ processors on a CRCW PRAM.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
