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"”.

  1. 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 …

    portland-state Repository record for Tree Graphs and Orthogonal Spanning Tree Decompositions (opens in a new tab)

  2. 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 …

    csusb Repository record for Minimal congestion trees (opens in a new tab)

  3. 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 …

    csusb-retro Repository record for Minimal congestion trees (opens in a new tab)

  4. 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 …

    vt Repository record for Table-driven quadtree traversal algorithms (opens in a new tab)

  5. Hypertrees in d-uniform hypergraphs

    Thesis (Ph. D.)--Michigan State University. Department of Mathematics, 2002

    msu Repository record for Hypertrees in d-uniform hypergraphs (opens in a new tab)

  6. Independent sets in (r, s)-trees

    Thesis (Ph. D.)--Michigan State University. Department of Mathematics, 1992

    msu Repository record for Independent sets in (r, s)-trees (opens in a new tab)

  7. 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 …

    binghamton Repository record for An analytic approach to problems connected with plane tree enumeration (opens in a new tab)

  8. 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 …

    arizona-thes Repository record for Direct sparse matrix methods for interior point algorithms. (opens in a new tab)

  9. On graphs with large numbers of spanning trees

    Thesis (Ph. D.)--Michigan State University. Department of Computer Science, 2005

    msu Repository record for On graphs with large numbers of spanning trees (opens in a new tab)

  10. 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 …

    portland-state Repository record for Forest Generating Functions of Directed Graphs (opens in a new tab)

  11. 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 …

    massey Repository record for 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 (opens in a new tab)

  12. 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 …

    vt Repository record for On the performance of B-trees using dynamic address computation (opens in a new tab)

  13. Enumeration of symmetries in locally-restricted trees

    Thesis (Ph. D.)--Michigan State University. Department of Mathematics, 1987

    msu Repository record for Enumeration of symmetries in locally-restricted trees (opens in a new tab)

  14. 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 …

    uvic Repository record for Dynamic algorithms for chordal and interval graphs (opens in a new tab)

  15. 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 …

    texas Repository record for On the shortest path and minimum spanning tree problems (opens in a new tab)

Page 1 of 3