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 20 of 55 for “"Trees Graph theory"”.
-
Tree Graphs and Orthogonal Spanning Tree Decompositions
Given a graph G, we construct T(G), called the tree graph of G. The vertices of T(G) are the spanning trees of G, with edges between vertices when their respective spanning trees differ only by a single edge. In this paper we detail many new results concerning tree graphs, involving topics such as …
-
Minimal congestion trees
… the minimal edge congestion for finite simple graphs. Uses the generic results of the theorem to examine and further reduce the parameters of inequalities for specific families of graphs, particularly complete graphs and complete bipartite graphs. Also, explores a possible minimal congestion …
-
Minimal congestion trees
… the minimal edge congestion for finite simple graphs. Uses the generic results of the theorem to examine and further reduce the parameters of inequalities for specific families of graphs, particularly complete graphs and complete bipartite graphs. Also, explores a possible minimal congestion …
-
Table-driven quadtree traversal algorithms
Two quadtree algorithms are presented that use table driven traversals to reduce the time complexity required to achieve their respective goals. The first algorithm is a two step process that converts a boundary representation of a polygon into a corresponding region representation of the same …
-
Hypertrees in d-uniform hypergraphs
Thesis (Ph. D.)--Michigan State University. Department of Mathematics, 2002
-
The distribution of points by degree and orbit size in various species of trees
Thesis (Ph. D.)--Michigan State University. Department of Mathematics, 1981
-
Independent sets in (r, s)-trees
Thesis (Ph. D.)--Michigan State University. Department of Mathematics, 1992
-
An analytic approach to problems connected with plane tree enumeration
… structures can be related to a set of plane trees that has eliminated all trees that contain any element of a defined set of forbidden substructures. In computer science, such a set of plane trees can be used to describe lists. The cell growth problem can also be investigated in a similar …
-
Direct sparse matrix methods for interior point algorithms.
… It is based on modifications and extensions of graph theory applied to sparse matrices. The row and column permutation of a sparse symmetric positive definite matrix dramatically affects the performance of solution algorithms. Various reordering methods are considered to find the best ordering …
-
On graphs with large numbers of spanning trees
Thesis (Ph. D.)--Michigan State University. Department of Computer Science, 2005
-
Isomorphic vertex colorings of trees with two degree two vertices and maximum degree three
Master of Science (M.S.)
-
Forest Generating Functions of Directed Graphs
… the vertex and edge sets of a given directed graph. In this thesis, we establish a general framework to study spanning forest polynomials, associating them with a generalized Laplacian matrix and studying its properties. We introduce a novel proof of the famous matrix-tree theorem and show how …
-
The edge slide graph of the n-dimensional cube : a thesis presented in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Mathematics at Massey University, Manawatū, New Zealand
… of this thesis is to understand the spanning trees of the n-dimensional cube Qn by understanding their edge slide graph. An edge slide is a move that “slides” an edge of a spanning tree of Qn across a two-dimensional face, and the edge slide graph is the graph on the spanning trees of Qn with …
-
On the performance of B-trees using dynamic address computation
… by Cook that can be used to implement B-trees using no pointers. A minimal amount of storage (in addition to the keys) is required. An implementation of Dynamic Address Computation and a B-tree management package is described. Analytical performance measures are derived in an attempt to …
-
Enumeration of symmetries in locally-restricted trees
Thesis (Ph. D.)--Michigan State University. Department of Mathematics, 1987
-
Dynamic algorithms for chordal and interval graphs
… 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 …
-
On the shortest path and minimum spanning tree problems
… that all of our algorithms work with general graphs, and make no restrictive assumptions on the numerical representation of edge-lengths. A provably optimal deterministic minimum spanning tree algorithm. (We give a constructive proof that the algorithmic complexity of the minimum spanning tree …
Page 1 of 3