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 68 for “"directed graphs"”.
-
Knitting with directed graphs
… structures by their geometry separate from a directed graph description of their topology. This thesis presents an algorithm that can generate a natural, deformed two-dimensional layout of Knit Meshes as well as a conversion pipeline that converts written hand knitting instructions to and from …
-
On cycles in directed graphs
The main results of this thesis are the following. We show that for each alpha > 0 every sufficiently large oriented graph G with minimum indegree and minimum outdegree at least 3 |G| / 8 + alpha |G| contains a Hamilton cycle. This gives an approximate solution to a problem of Thomassen. …
-
A∞-algebras on directed graphs
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-10-19 without embargo terms
-
Cyclic Level Drawings of Directed Graphs
… graph drawing and is widely used for visualizing directed graphs. In its common version, it draws graphs hierarchically and, hence, maps the topological direction to a geometric direction. However, such a hierarchical layout is not possible if the graph contains cycles, which have to be destroyed …
-
Fast spectral primitives for directed graphs
… linear time algorithms for a large class of directed graph problems including computing the stationary distribution of a Markov chain with only a logarithmic dependence on the mixing time. Our approach is based on developing new spectral tools for directed graphs, including the first …
-
Complexity of Dyck-reachability in directed graphs
We study the problem of Dyck-reachability in directed graphs de ned as follows: given a directed graph with edges labeled by either open or close parentheses, we claim that a vertex is Dyck-reachable from another if there is a path between these two vertices such that the string described by …
-
The regularity method in directed graphs and hypergraphs
… G on 2n − 2 vertices contains a copy of any directed tree T on n vertices. An analysis of the extremal cases then proves that Sumner’s universal tournament conjecture holds for any sufficiently large n. Our methods are also applied to the problem of obtaining hypergraph analogues of Dirac’s …
-
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 …
-
Narrative Generation to Support Causal Exploration of Directed Graphs
Causal graphs are a useful notation to represent the interplay between the actors as well as the polarity and strength of the relationship that they share. They are used extensively in educational, professional, and industrial contexts to simulate different scenarios, validate behavioral aspects, …
-
Fault-tolerant consensus in directed graphs and convex hull consensus
… networks that are modeled as arbitrary directed graphs, i.e., two pairs of nodes may not share a bi- directional communication channel, and not every pair of nodes may be able to communicate with each other directly or indirectly. We prove the tight condition of the underlying …
-
The power of a pebble : exploring and mapping directed graphs
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1998.
-
Increasing performance in Force Directed Graphs: an application in cancer support service provision profiling
… of a 3D data visualisation tool using Force Node Graphs (FNG). This project was run with stakeholders from the Digital Health and Innovation Centre (DHI) and Macmillan Cancer Support (Macmillan). It uses the FNG to display association rule minded data from an eHNA data set provided by Macmillan. …
-
Exact covering system digraphs a number-theoretic family of directed graphs on the integers
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-11 without embargo terms
-
Graphs and Noncommutative Koszul Algebras
… is established by relating a certain class of directed graphs to noncommutative Koszul algebras. The directed graphs in this class are called full graphs and are defined by a set of criteria on the edges. The structural properties of full graphs are studied as they relate to the edge criteria. …
-
Geometry of Fractal Squares
… sets. Also discussed will be a technique using directed graphs to prove bilipschitz equivalence of two fractal squares.
-
Planar Graphs and their Duals on Cylinder Surfaces
… this thesis, we investigates plane drawings of undirected and directed graphs on cylinder surfaces. In the case of undirected graphs, the vertices are positioned on a line that is parallel to the cylinder’s axis and the edge curves must not intersect this line. We show that a plane drawing is …
-
Geometry of Self-Similar Sets
… techniques, one involving the use of directed graphs, show the equivalence of two spaces.
-
Probabilistic Firefighting on the Integer Lattice
… we find it helpful to extend firefighting to directed graphs. We answer questions about the integer lattice, the area most commonly studied in firefighting.
-
Closely Interacting Figures in a Virtual Environment
… the Artificial Intelligence domain. Weighted-directed graphs are used to capture the style properties of the motion-captured sequences, and to create motion fragments that are consistent with that style. A similar technique is used to solve the recognition problem during interaction. …
Page 1 of 4