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 276 for “"directed graph"”.

  1. Directed Graph Cryptosystems

    Cryptography is a necessary tool for secrecy in our increasingly connected and data-driven world. As advances are made in both mathematics and com­puter hardware design, existing cryptosystems must be improved or replaced to maintain privacy of sensitive data. In this paper we propose a novel …

    central-wash Repository record for Directed Graph Cryptosystems (opens in a new tab)

  2. Maximally Edge-Colored Directed Graph Algebras

    Graph C*-algebras are constructed using projections corresponding to the vertices of the graph, and partial isometries corresponding to the edges of the graph. Here, we use the gauge-invariant uniqueness theorem to first establish that the C*-algebra of a graph composed of a directed cycle with …

    ndsu Repository record for Maximally Edge-Colored Directed Graph Algebras (opens in a new tab)

  3. Directed graph limits and directed threshold graphs

    We look at the recently developed concept of graphons first discussed by Lovász and Szegedy in 2004. These are continuous versions of adjacency matrices which arise as limits of sequences of graphs. We develop the concepts that generalize graphons to directed graphs. Several papers by Diaconis and …

    nebraska Repository record for Directed graph limits and directed threshold graphs (opens in a new tab)

  4. Inferring Undirected and Causally Directed Graph Structures from Multivariate Time Series

    … cortex of primates using a novel variation of undirected graph learning based on smoothness prior. In Part Two, we define and implement a novel spatiotemporal graph (STG) model for inferring causally directed graphs. Analysis of brain connectivity networks has a potential to advance our …

    claremont Repository record for Inferring Undirected and Causally Directed Graph Structures from Multivariate Time Series (opens in a new tab)

  5. Data aggregation using peer to peer network and dynamic directed graph operation

    … and time complexity.<br><br>We introduce the directed Flip-Chain algorithm, which transforms the d-regular multidigraph into another d-regular multidigraph by swapping two adjacent vertices in the trail of directed edges. Repeatedly applying the directed Flip-Chain operation to an arbitrary …

    freiburg-diss Repository record for Data aggregation using peer to peer network and dynamic directed graph operation (opens in a new tab)

  6. Adaptive Force-Directed Graph Drawing: Structure-Aware Methods and Reinforcement Learning-Based Parameter Control

    Force-directed graph drawing provides a flexible approach to graph visualization, but layout quality can depend on graph structure and on how the layout process is configured during refinement. This thesis investigates two complementary approaches to adaptive force-directed drawing. The first …

    brock Repository record for Adaptive Force-Directed Graph Drawing: Structure-Aware Methods and Reinforcement Learning-Based Parameter Control (opens in a new tab)

  7. Force-Directed Graph Drawing and Aesthetics Measurement in a Non-Strict Pure Functional Programming Language

    … of non-strict evaluation and immutable state. Graph drawing algorithms, while numerous and broadly studied, have no presence in the non-strict pure functional programming model. Additionally, there is currently no freely licensed standalone toolkit used to quantitatively analyze aesthetics of …

    unt Repository record for Force-Directed Graph Drawing and Aesthetics Measurement in a Non-Strict Pure Functional Programming Language (opens in a new tab)

  8. DEEP LEARNING ON GRAPH-STRUCTURED DATA

    Graph Neural Networks (GNNs) are generalized deep learning methods for processing graph-structured data. While GNNs have been widely utilized for various real-world tasks, such as social network analysis and drug discovery, their use in directed graphs is still in its infancy due to limitations in …

    nus Repository record for DEEP LEARNING ON GRAPH-STRUCTURED DATA (opens in a new tab) Download file for DEEP LEARNING ON GRAPH-STRUCTURED DATA (opens in a new tab)

  9. Approximating Longest Path

    … the longest path and the longest cycle in undirected and directed graphs on n vertices. We show that * in any expander graph, we can find (n) long paths in polynomial time. * there is an algorithm that finds a path of length (log2 L/ log log L) in any undirected graph having a path of length …

    lund Repository record for Approximating Longest Path (opens in a new tab) Download PDF for Approximating Longest Path (opens in a new tab)

  10. New Simple Representations of Leavitt Path Algebras

    … Chen modules over the Leavitt Path Algebra of a directed graph. We then give some thought to its extension to other modules, and present new classes of simple Leavitt Path Algebra modules previously unknown. These are modules generated by indicator functions of closed sets of the set of all …

    oklahoma-thes Repository record for New Simple Representations of Leavitt Path Algebras (opens in a new tab)

  11. Universal operator algebras of directed graphs

    We investigate universal operator algebras of directed graphs. We begin with the constructions of the universal operator algebra and universal C*-algebra of a directed graph. We show that each universal algebra can be decomposed as a free product of algebras associated to subgraphs. We also …

    nebraska Repository record for Universal operator algebras of directed graphs (opens in a new tab)

  12. On the Strongly Connected Components of Random Directed Graphs with Given Degree Sequences

    A strongly connected component of a directed graph G is a maximal subgraph H of G such that for each pair of vertices u and v in H, there is a directed path from u to v and a directed path from v to u in H. A strongly connected component is said to be giant if it has linear size. We determine the …

    waterloo Repository record for On the Strongly Connected Components of Random Directed Graphs with Given Degree Sequences (opens in a new tab)

  13. Eigenvalue Spacings of Transition Matrices Associated to Directed Graphs

    … Markov chains and explores their applications to directed graphs. We derive an explicit expression for the error term in the convergence theorem in terms of the eigenvalues of the transition matrix. This expression reveals that the convergence behaviour is governed not only by the spectral gap but …

    queens Repository record for Eigenvalue Spacings of Transition Matrices Associated to Directed Graphs (opens in a new tab)

  14. Graph determined symbolic dynamics and hybrid systems

    … systems whose structure is determined by a directed graph, and then discrete-continuous hybrid systems that arise from such dynamical systems. Typically, symbolic dynamics involve the study of a left shift of a bi-infinite sequence. We examine the case when the bi-infinite system is dictated …

    iastate Repository record for Graph determined symbolic dynamics and hybrid systems (opens in a new tab)

  15. Relation algebras and vertex conditions in graph theory

    … t]?;A scheme can be associated with a graph. This scheme is an association scheme if and only if the graph is strongly regular. A height t presuperscheme consists of the bottom t levels of a superscheme. The dissertation contains a construction of a presuperscheme associated with a …

    iastate Repository record for Relation algebras and vertex conditions in graph theory (opens in a new tab)

  16. Large structures in dense directed graphs

    … answer questions in extremal combinatorics, for directed graphs. Specifically, we investigate which large tree-like directed graphs are contained in all dense directed graphs of large order. More precisely, let T be an oriented tree of order n; among others, we establish the following results. …

    birmingham Download PDF for Large structures in dense directed graphs (opens in a new tab)

  17. Design of algorithm transformations for VLSI array processing

    … The algorithm is modeled as a program graph which is a directed graph. Techniques are suggested to regularize the data-flou in an algorithm, thereby minimizing the communication requirements of the architecture. We derive a set of sufficient conditions on the structure of data-flou of a …

    ttu Repository record for Design of algorithm transformations for VLSI array processing (opens in a new tab)

  18. Interactive visualization of metabolic networks using virtual reality

    <p>A combination of graph layouts in 3D space, interactive computer graphics, and virtual reality (VR) can increase the size of understandable networks for metabolic network visualization. Two models, the directed graph and the compound graph, were used to represent a metabolic network. The …

    iastate Repository record for Interactive visualization of metabolic networks using virtual reality (opens in a new tab)

  19. Solutions to controllability and observability problems in distributed testing.

    … a set of transformation rules to construct a directed graph from a given specification. A transition tour of this directed graph based on a rural Chinese postman tour will result in a test sequence with no potential for controllability or observability problems, and where the use of …

    ottawa-retro Repository record for Solutions to controllability and observability problems in distributed testing. (opens in a new tab)

Page 1 of 14