Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 8 of 8 for “"Connectivity Augmentation"”.
-
Decomposition-based methods for Connectivity Augmentation Problems
… thesis, we study approximation algorithms for Connectivity Augmentation and related problems. In the Connectivity Augmentation problem, one is given a base graph G=(V,E) that is k-edge-connected, and an additional set of edges $L \subseteq V\times V$ that we refer to as links. The task is to …
-
New Algorithms for Network Connectivity and Reliability
<p>Network connectivity and reliability are fundamental topics in graph algorithms, with wide-ranging applications in the design and evaluation of real-world networks. These notions can be viewed as two complementary measures of robustness under link failures, corresponding respectively to …
-
Efficient processing of hierarchical graphs
… The problems we study belong to three classes: connectivity augmentation, subgraph homeomorphism, and matroid optimization. The P-connectivity augmentation problem, where P is a connectivity property, is to determine the number of edges that must be added to a graph to satisfy P. We present …
-
Connectivity and spanning trees of graphs
This dissertation focuses on connectivity, edge connectivity and edge-disjoint spanning trees in graphs and hypergraphs from the following aspects.;1. Eigenvalue aspect. Let lambda2(G) and tau( G) denote the second largest eigenvalue and the maximum number of edge-disjoint spanning trees of a graph …
-
Algorithmic aspects of connectivity and density in graphs and hypergraphs
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-10-19 without embargo terms