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 23 for “"graph operations"”.

  1. Splitter theorems for 3- and 4-regular graphs

    Let g be a class of graphs and ≤ be a graph containment relation. A splitter theorem for g under ≤ is a result that claims the existence of a set O of graph operations such that if G and H are in g and H≤G with G≠H, then there is a decreasing sequence of graphs from G to H, say G=G0≥G1≥G2...Gt=H, …

    lsu-thes Repository record for Splitter theorems for 3- and 4-regular graphs (opens in a new tab)

  2. Graph Theory for the Middle School.

    After being introduced to graph theory and realizing how it can be utilized to solve real-world problems, the author decided to create modules of study on graph theory appropriate for middle school students. In this thesis, four modules were developed in the area of graph theory: an Introduction to …

    etsu Repository record for Graph Theory for the Middle School. (opens in a new tab) Download PDF for Graph Theory for the Middle School. (opens in a new tab)

  3. A treatise on pansophy

    … introduced a new parameter, the pansophy of a graph, which is the expected value of the number of disjointly-routable paths in a graph given a random distribution of ordered starting and stopping points. We present an introduction to the topic and prove several results related to pansophy, …

    iastate Repository record for A treatise on pansophy (opens in a new tab)

  4. Properties of the Zero Forcing Number

    The zero forcing number is a graph parameter first introduced as a tool for solving the minimum rank problem, which is: Given a simple, undirected graph G, and a field F, let S(F,G) denote the set of all symmetric matrices A=[a_{ij}] with entries in F such that a_{ij} doess not equal 0 if and only …

    byu Repository record for Properties of the Zero Forcing Number (opens in a new tab) Download PDF for Properties of the Zero Forcing Number (opens in a new tab)

  5. Efficient Robot Motion Planning in Cluttered Environments

    … care homes and mobile robots assisting in rescue operations. Central to any robot that needs to navigate its environment, is Motion Planning: the task of computing a collision-free motion for a (robotic) system between given start and goal states in an environment cluttered with obstacles. As …

    washington Repository record for Efficient Robot Motion Planning in Cluttered Environments (opens in a new tab)

  6. An Enhancement of Distributed Graph Queries in an Agent-Based Graph Database

    Graph databases have become essential in domains requiring real-time querying of highlyinterconnected data. This work is an enhancement of the querying capabilities of a distributed agent-based graph database. Built using the MASS (Multi-Agent Spatial Simulation) Java library, it combines the …

    washington Repository record for An Enhancement of Distributed Graph Queries in an Agent-Based Graph Database (opens in a new tab)

  7. Cohen-Macaulay Properties of Closed Neighborhood Ideals

    … edge ideal [11]: given a finite simple graph G with vertices x1, . . . , xn, the edge ideal of G is generated by all the monomials of the form xixj where xi and xj are adjacent in G. Villareal’s characterization of Cohen-Macaulay edge ideals associated to trees is an often-cited result …

    clemson Repository record for Cohen-Macaulay Properties of Closed Neighborhood Ideals (opens in a new tab)

  8. Mixed covering arrays on graphs and tabu search algorithms

    … networks and circuits. Mixed covering arrays on graphs are new generalizations of both mixed covering arrays and covering arrays on graphs. In this thesis, we give new theoretical results and constructions for mixed covering arrays on graphs. First, we extend to the mixed case the work done by …

    ottawa-retro Repository record for Mixed covering arrays on graphs and tabu search algorithms (opens in a new tab)

  9. Semantic Operations for Transfer-based Machine Translation

    … aligning semantic fragments (or semantic subgraphs) and a heuristic strategy for aligning nodes between source and target subgraphs, which together allow me to design transfer systems that meet, and at times exceed, the translation coverage and quality of the prior state of the art with a …

    washington Repository record for Semantic Operations for Transfer-based Machine Translation (opens in a new tab)

  10. Data parallel algebraic multigrid

    … is severely limited by irregular sparse matrix operations, most notably sparse matrix-matrix multiplication. In the second phase, we address this performance bottleneck using novel techniques to optimize irregular sparse matrix operations. This dissertation is also concerned with irregular graph …

    uiuc Repository record for Data parallel algebraic multigrid (opens in a new tab)

  11. Graph Processing in Main-Memory Column Stores

    … applications leverage the advantages of a graph data model, such as the offered schema flexibility and an explicit representation of relationships between entities. As a consequence, companies are confronted with the challenge of storing, manipulating, and querying terabytes of graph data …

    qucosa-diss

  12. Some results on cubic graphs

    … Oxley, we investigate whether the edge set of a graph admits a bipartition so that the contraction of either partite set produces a series-parallel graph. While Oxley's question in general remains unanswered, our investigations led to two graph operations (Chapters 2 and 4) which are of …

    lsu-thes Repository record for Some results on cubic graphs (opens in a new tab)

  13. Large-scale transactional execution of FPGA-accelerated irregular applications

    … around pointer-based data structures such as graphs. They are widely used in many fields such as computer/human network analysis, machine learning, data mining, graphics, electronic design automation, and so on. Many irregular applications have massive data-level parallelism because they …

    texas Repository record for Large-scale transactional execution of FPGA-accelerated irregular applications (opens in a new tab)

  14. Characterizations of Certain Classes of Graphs and Matroids

    ``If a theorem about graphs can be expressed in terms of edges and cycles only, it probably exemplifies a more general theorem about matroids." Most of my work draws inspiration from this assertion, made by Tutte in 1979. In 2004, Ehrenfeucht, Harju and Rozenberg proved that all graphs can be …

    lsu-thes Repository record for Characterizations of Certain Classes of Graphs and Matroids (opens in a new tab)

  15. Algorithmic Distribution of Applied Learning on Big Data

    Machine Learning and Graph techniques are complex and challenging to distribute. Generally, they are distributed by modeling the problem in a similar way as single node sequential techniques except applied on smaller chunks of data and compute and the results combined. These techniques focus on …

    vt Repository record for Algorithmic Distribution of Applied Learning on Big Data (opens in a new tab)

  16. On the class of graphs ZP

    … research was primarily focused on the class of graphs denoted by ZP. Let G = (V,E) be a graph made up of vertices V and edges E. The path cover number and zero forcing number are two graph parameters that have been of recent research interests and are closely related. Zero forcing at it’s most …

    regina Repository record for On the class of graphs ZP (opens in a new tab)

  17. The Minimum Witt Index of a Graph

    An independent set in a graph G is a set of pairwise nonadjacent vertices, and the maximum size, alpha(G), of an independent set in G is called the independence number. Given a graph G and weight matrix A of G with entries from some field F, the maximum dimension of an A-isotropic subspace, known …

    queens Repository record for The Minimum Witt Index of a Graph (opens in a new tab)

  18. Quantum pure state transfer

    … and Laplacian matrices as Hamiltonians of a graph representing a spin network. We prove basic results about eigenvalue supports, periodicity, and strong cospectrality on pure states. We investigate a special type of strong cospectrality called m-strong cospectrality, and show that m-strongly …

    manitoba Repository record for Quantum pure state transfer (opens in a new tab)

  19. Identifying Patients at Risk of Sudden Cardiac Arrest using Graph Representation Learning on Electronic Health Records

    … and may not use similarity between visits. Graph-based methods can model relationships among patients, but many require graph computations during inference, which increases computational cost. In addition, many existing EHR-based graphs are constructed from fixed clinical attributes such as …

    calgary Repository record for Identifying Patients at Risk of Sudden Cardiac Arrest using Graph Representation Learning on Electronic Health Records (opens in a new tab)

  20. Multimodal Networks in Biology

    … databases. An MMN subsumes the structure of graphs and hypergraphs, either undirected or directed. Formally, an MMN is a triple (V,E,M) where V is a set of vertices, E is a set of modal hyperedges, and M is a set of modes. A modal hyperedge e=(T,H,A,m) in E is an ordered 4-tuple, in which …

    vt Repository record for Multimodal Networks in Biology (opens in a new tab)

Page 1 of 2