Global ETD Search

811	Magic and antimagic labeling of graphs Sugeng, Kiki Ariyanti . University of Ballarat. January 2005 (has links) "A bijection mapping that assigns natural numbers to vertices and/or edges of a graph is called a labeling. In this thesis, we consider graph labelings that have weights associated with each edge and/or vertex. If all the vertex weights (respectively, edge weights) have the same value then the labeling is called magic. If the weight is different for every vertex (respectively, every edge) then we called the labeling antimagic. In this thesis we introduce some variations of magic and antimagic labelings and discuss their properties and provide corresponding labeling schemes. There are two main parts in this thesis. One main part is on vertex labeling and the other main part is on edge labeling." / Doctor of Philosophy Magic labeling Graph labeling Graph theory Data processing Vertex labeling Edge labeling Australian Digital Thesis
812	A formal framework for linguistic tree query / Lai, Catherine. January 2005 (has links) Research. Thesis (M.Sc.)--University of Melbourne, Dept. of Computer Science and Software Engineering, 2006. / Typescript. Includes bibliographical references (leaves 163-170).
813	Tree-based decompositions of graphs on surfaces and applications to the traveling salesman problem Inkmann, Torsten. January 2007 (has links) Thesis (Ph. D.)--Mathematics, Georgia Institute of Technology, 2008. / Committee Chair: Thomas, Robin; Committee Co-Chair: Cook, William J.; Committee Member: Dvorak, Zdenek; Committee Member: Parker, Robert G.; Committee Member: Yu, Xingxing.
814	Intruder capture by mobile agents in mesh topologies / Song, Lisa Xiuli, January 1900 (has links) Thesis (M.C.S.) - Carleton University, 2005. / Includes bibliographical references (p. 127-130). Also available in electronic format on the Internet.
815	A high-performance framework for analyzing massive complex networks Madduri, Kamesh January 2008 (has links) Thesis (Ph.D.)--Computing, Georgia Institute of Technology, 2009. / Committee Chair: Bader, David; Committee Member: Berry, Jonathan; Committee Member: Fujimoto, Richard; Committee Member: Saini, Subhash; Committee Member: Vuduc, Richard
816	Force-directed graph drawing and aesthetics measurement in a non-strict pure functional programming language Gaconnet, Christopher James. Tarau, Paul, January 2009 (has links) Thesis (M.S.)--University of North Texas, Dec., 2009. / Title from title page display. Includes bibliographical references.
817	Prediction of recurrence in thin melanoma using trees and random forests / Reiter, Richard M. January 2005 (has links) Thesis (M.S.)--University of North Carolina at Wilmington, 2005. / Includes bibliographical references (leaves: 60-61)
818	Sink free orientations in a graph Sivanathan, Gowrishankar. January 2009 (has links) Thesis (M.S.)--State University of New York at Binghamton, Thomas J. Watson School of Engineering and Applied Science, Department of Computer Science, 2009. / Includes bibliographical references.
819	Edge-to-edge multicast overlay trees for real time video distribution / Brooks, Jeffrey, January 2003 (has links) Thesis (M.S.)--University of Missouri-Columbia, 2003. / Typescript. Includes bibliographical references (leaves 132-133). Also available on the Internet.
820	Edge-to-edge multicast overlay trees for real time video distribution Brooks, Jeffrey, January 2003 (has links) Thesis (M.S.)--University of Missouri-Columbia, 2003. / Typescript. Includes bibliographical references (leaves 132-133). Also available on the Internet.

Search results