Thesis (Ph. D. in Software Engineering)--Naval Postgraduate School, Sept. 2004. / Thesis Advisor(s): Luqi. Includes bibliographical references. Also available online.

Thesis (Ph. D.)--Aerospace Engineering, Georgia Institute of Technology, 2004. / Ajay Misra, Committee Member ; James Craig, Committee Member ; Richard Neu, Committee Member ; Daniel Schrage, Committee Member ; Dimitri Mavris, Committee Chair. Vita. Includes bibliographical references.

Thesis (M.S.)--Ohio University, August, 2004. / Includes bibliographical references (p. 135-139).

Thesis (Ph.D)--Electrical and Computer Engineering, Georgia Institute of Technology, 2009. / Committee Chair: Divan, Deepakraj M.; Committee Member: Begovic, Miroslav M.; Committee Member: Brown, Marilyn; Committee Member: Harley, Ronald G.; Committee Member: Wolf, Wayne H. Part of the SMARTech Electronic Thesis and Dissertation Collection.

Thesis (M.S.)--State University of New York at Binghamton, Thomas J. Watson School of Engineering and Applied Science, Department of Systems Science and Industrial Engineering, 2009. / Includes bibliographical references.

Thesis (M.S.)--Air Force Institute of Technology, 2006. / "AFIT/GLM/ENS/06-08." "March 2006." Includes bibliographical references (leaves 217-219). Also available online via the Defense Technical Information Center website (http://stinet.dtic.mil/).

Thesis (Ph.D.)(Industrial and Systems Engineering))--University of Pretoria, 2006. / Includes summary. Includes bibliographical references. Available on the Internet via the World Wide Web.

Thesis (M.S.)--Ohio University, August, 2004. / Title from PDF t.p. Includes bibliographical references (p. 135-139)

Thesis (Ph. D.)--Ohio State University, 1985. / Includes bibliographical references (leaves 300-307). Available online via OhioLINK's ETD Center.

Thesis (MSc (Logistics)--University of Stellenbosch, 2007. / There exists, for any connected graph G, a minimum set of vertices that, when removed, disconnects G. Such a set of vertices is known as a minimum cut-set, the cardinality of which is known as the connectivity number k(G) of G. A connectivity preserving [connectivity reducing, respectively] spanning subgraph G0 ? G may be constructed by removing certain edges of G in such a way that k(G0) = k(G) [k(G0) < k(G), respectively]. The problem of constructing such a connectivity preserving or reducing spanning subgraph of minimum weight is known to be NP–complete. This thesis contains a summary of the most recent results (as in 2006) from a comprehensive survey of literature on topics related to the connectivity of graphs. Secondly, the computational problems of constructing a minimum weight connectivity preserving or connectivity reducing spanning subgraph for a given graph G are considered in this thesis. In particular, three algorithms are developed for constructing such spanning subgraphs. The theoretical basis for each algorithm is established and discussed in detail. The practicality of the algorithms are compared in terms of their worst-case running times as well as their solution qualities. The fastest of these three algorithms has a worst-case running time that compares favourably with the fastest algorithm in the literature. Finally, a computerised decision support system, called Connectivity Algorithms, is developed which is capable of implementing the three algorithms described above for a user-specified input graph.