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 8 of 8 for “"tree graph"”.

  1. The Existence and Generation of a Hamilton Circuit in a Tree Graph

    Made available in DSpace on 2014-12-08T22:24:05Z (GMT). No. of bitstreams: 1 6706642.pdf: 1276319 bytes, checksum: e37b344a8f9743efa53d201a0adecaa6 (MD5) Previous issue date: 1966

    uiuc Repository record for The Existence and Generation of a Hamilton Circuit in a Tree Graph (opens in a new tab)

  2. On the Discrete Number of Tree Graphs

    … Given a set of points in Euclidean space and a tree graph consisting of a much smaller number of vertices, we study the maximum possible number of tree graphs which can be represented by a prescribed tree graph. We derive an algorithm for finding tight bounds for this family of problems up to …

    vt Repository record for On the Discrete Number of Tree Graphs (opens in a new tab)

  3. Speculative parallelism in Intel Cilk Plus

    … work. One example is searching an unordered tree graph for a particular node. Each subtree can be searched in parallel by a separate thread. Once a single thread is successful, however, the work of the others is unneeded and should be ended. This type of computation is known as speculative …

    mit Repository record for Speculative parallelism in Intel Cilk Plus (opens in a new tab)

  4. Capacitated, unbalanced p-median problems on a chain graph with a continuum of link demands

    … of locating p capacitated facilities on a chain graph, and simultaneously determining the allocation of their supplies in order to satisfy a continuum of demand which is characterized by some weighted probability density function defined on the chain graph. The objective is to minimize the total …

    vt Repository record for Capacitated, unbalanced p-median problems on a chain graph with a continuum of link demands (opens in a new tab)

  5. Topics in quantum information theory and quantum many-body physics

    … the use of quantum walks to traverse the welded tree graph, due to Childs, Cleve, Deotto, Farhi, Gutmann, and Spielman. We show how to generalize this to a large class of hierarchical graphs in which the vertices are grouped into “supervertices” that are arranged according to a d-dimensional …

    mit Repository record for Topics in quantum information theory and quantum many-body physics (opens in a new tab)

  6. Balanced, capacitated, location-allocation problems on networks with a continuum of demand

    … facilities are to be located on a chain graph having both nodal and link demands, the latter of which are defined by nonnegative, integrable demand functions. In addition, the problem is balanced, in that it is assumed the total demand equals the total supply. An exact solution procedure …

    vt Repository record for Balanced, capacitated, location-allocation problems on networks with a continuum of demand (opens in a new tab)

  7. Dynamics on networks

    … consider two dynamical models whose underlying graph can be represented by a single network. We first consider the Kuramoto model, a canonical model of coupled phase oscillators. We obtain two results on its partial phase-locked state, where a subset of oscillators remain close in phase while …

    uiuc Repository record for Dynamics on networks (opens in a new tab)

  8. A Predictive Model for Secondary RNA Structure Using Graph Theory and a Neural Network.

    <p>In this work we use a graph-theoretic representation of secondary RNA structure found in the database RAG: RNA-As-Graphs. We model the bonding of two RNA secondary structures to form a larger structure with a graph operation called merge. The resulting data from each tree merge operation is …

    etsu Repository record for A Predictive Model for Secondary RNA Structure Using Graph Theory and a Neural Network. (opens in a new tab)