Back to results
University of Illinois at Urbana-Champaign
Vertex Connectivity of Graphs: Algorithms and Bounds
Abstract
dc:descriptionThis thesis concerns several problems concerning vertex connectivity of undirected graphs and presents new bounds and algorithms for these problems.
Degree
thesis:*- Name thesis:degree_name
- Ph.D.
- Level thesis:degree_level
- Dissertation
- Discipline thesis:degree_discipline
- Computer Science
- Grantor
- University of Illinois at Urbana-Champaign
- Year dc:date
- 2014
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Kanevsky, Arkady
- Contributors dc:contributor
-
- Ramachandran, V.
Subjects
dc:subject × 1Identifiers
dc:identifier.*- Identifier
- (UMI)AAI8908726
- OAI identifier oai:identifier
- oai:www.ideals.illinois.edu:2142/69601