Global ETD Search

51	Multiplicity lists for classes of Hermitian matrices whose graph is a certain tree / McMichael, Paul Robert. January 2008 (has links) Thesis (Honors)--College of William and Mary, 2008. / Includes bibliographical references (leaf 47). Also available via the World Wide Web.
52	The application of atheoretical regression trees to problems in time series analysis : a thesis submitted in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Mathematics, Department of Mathematics and Statistics, University of Canterbury / Rea, William S. January 2008 (has links) Thesis (Ph. D.)--University of Canterbury, 2008. / Typescript (photocopy). Includes bibliographical references (leaves 265-282). Also available via the World Wide Web.
53	A computational model of arterial structures : a relationship to Alzheimer's disease : a thesis submitted in partial fulfilment of the requirements for the degree of Master of Biomedical Engineering in the University of Canterbury / Kristinsdottir, Svava. January 2009 (has links) Thesis (M.E.)--University of Canterbury, 2009. / Typescript (photocopy). Includes bibliographical references (leaves 139-142). Also available via the World Wide Web.
54	On the shortest path and minimum spanning tree problems Pettie, Seth, January 2003 (has links) (PDF) Thesis (Ph. D.)--University of Texas at Austin, 2003. / Vita. Includes bibliographical references. Available also from UMI Company.
55	The reconstruction and analysis of the Report WASH 1400 auxiliary feedwater system fault tree and its application to selected safety concerns / Skelley, William A. January 1900 (has links) Thesis (M.S.)--University of Michigan, 1980.
56	Aspects of the Cops and Robber game played with incomplete information / Jeliazkova, Diana. January 1900 (has links) Thesis (M.Sc.)--Acadia University, 2006. / Includes bibliographical references (leaves 142-143). Also available on the Internet via the World Wide Web.
57	Optimal search protocols / Bedrax-Weiss, Tania. January 1999 (has links) Thesis (Ph. D.)--University of Oregon, 1999. / Typescript. Includes vita and abstract. Includes bibliographical references (leaves 206-211). Also available for download via the World Wide Web; free to University of Oregon users. Address: http://wwwlib.umi.com/cr/uoregon/fullcit?p9948016.
58	Evolution of tandemly repeated sequences : a thesis submitted in partial fulfilment of the requirements of the degree for Master of Science in Mathematics at the University of Canterbury / Snook, Michael January 2009 (has links) Thesis (M. Sc.)--University of Canterbury, 2009. / Typescript (photocopy). Includes bibliographical references (leaves 128-130) and index. Also available via the World Wide Web.
59	Theory of 3-4 heap : a thesis submitted in partial fulfilment of the requirements for the degree of Master of Science in the University of Canterbury / Bethlehem, Tobias. January 2008 (has links) Thesis (M. Sc.)--University of Canterbury, 2008. / Typescript (photocopy). Includes bibliographical references (p. 118-119). Also available via the World Wide Web.
60	Dynamic algorithms for chordal and interval graphs Ibarra, Louis Walter 05 July 2018 (has links) We present the first dynamic algorithm that maintains a clique tree representation of a chordal graph and supports the following operations: (1) query whether deleting or inserting an arbitrary edge preserves chordality, (2) delete or insert an arbitrary edge, provided it preserves chordality. We give two implementations. In the first, each operation runs in O( n) time, where n is the number of vertices. In the second, an insertion query runs in O(log² n) time, an insertion in O(n) time, a deletion query in O(n) time, and a deletion in O(n log n) time. We also introduce the clique-separator graph representation of a chordal graph, which provides significantly more information about the graph's structure than the well-known clique tree representation. We present fundamental properties of the clique-separator graph and additional properties when the input graph is interval. We then introduce the train tree representation of interval graphs and use it to decide whether there is a certain linear ordering of the graph's maximal cliques. This yields a fully dynamic algorithm to recognize interval graphs in O(n log n) time per edge insertion or deletion. The clique-separator graph may lead to dynamic algorithms for every proper subclass of chordal graphs, and the train tree may lead to fast dynamic algorithms for problems on interval graphs. / Graduate Computer hardware description languages Graph theory Algorithms Trees (Graph theory)

Search results