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 13 of 13 for “"connectivity problems"”.
-
Solving graph connectivity problems on JAGs
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1994.
-
Cut structures and randomized algorithms in edge-connectivity problems
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1997.
-
Analysis of linear programming relaxations for a class of connectivity problems
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 1990.
-
The O-D shortest path problem and connectivity problems on periodic graphs
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 1992.
-
Algorithms for connectivity problems in undirected graphs : maximum flow and minimun [kappa]-way cut.
We consider two connectivity problems on undirected graphs: maximum flow and minimum k-way cut. The maximum flow problem asks about the connectivity between two specified nodes. A traditional approach is to search for augmenting paths. We explore the possibility of restricting the set of edges in …
-
Toroidal Matrix Links: Local Matrix Homotopies and Soft Tori
In this document we solve some local connectivity problems in matrix representations of the form C(T^N) -> M_n and C(T^N) -> M_n <- C([-1, 1]^N) using the so called toroidal matrix links, which can be interpreted as normal contractive matrix analogies of free homotopies in algebraic topology. In …
-
Local area network (LAN) compatibility issues.
… network users and managers diagnose and resolve connectivity problems thus saving valuable time and money that can be used toward other productive endeavors within an organization. This thesis will discuss hardware and software concepts, LAN architecture, and design issues as they relate to …
-
Cuts and connectivity in graphs and hypergraphs
In this thesis, we consider cut and connectivity problems on graphs, digraphs, hypergraphs and hedgegraphs. The main results are the following: - We introduce a faster algorithm for finding the reduced graph in element-connectivity computations. We also show its application to node separation. - We …
-
Generalized nowhere zero flow
… = 0.;In this paper, we investigate the group connectivity number Lambda g(G) = min{lcub}n : if A is an abelian group with |A| ≥ n, then G is A-connected{rcub} for certain families of graphs including complete bipartite graphs, chordal graphs, wheels and biwheels. We also give some general …
-
A comparative analysis of the web information seeking behaviour of students and staff at the University of Zululand and the Durban University of Technology
… were identified, chief among them being connectivity problems. Bandwidth was particularly problematic and made worse by the two institutions’ large student populations. Relevant infrastructure (computer laboratories, computers, etc.) seemed available, although inadequate. The results shed …
-
Primal-Dual Techniques for Online Algorithms and Mechanisms
… it is often common to see a dual analysis of problems that can be formulated as a linear or convex program. Primal-dual and dual-fitting techniques have been successfully applied to many such problems. Unfortunately, the usual tricks come short in an online setting since an online algorithm …
-
The information behaviour of law students in Nigerian universities
… of computers and the lack of Internet connectivity. The majority of the respondents indicated that they possessed the ICT skills required to search for information using electronic information resources in the law libraries. The Internet facilities provided in the law library where only …