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 45 for “"graph decomposition"”.

  1. Distributed graph decomposition algorithms on Apache Spark

    … analysis and mining of large and complex graphs for describing the characteristics of a vertex or an edge in the graph have widespread use in graph clustering, classification, and modeling. There are various methods for structural analysis of graphs including the discovery of frequent …

    iupui Repository record for Distributed graph decomposition algorithms on Apache Spark (opens in a new tab)

  2. Graph decomposition algorithms for analyzing social and large complex networks

    Graphs are often used to model or represent large and sparse networks with billions of vertices and edges and store extensive amounts of structural and semantic information. Therefore, analyzing characteristics in networked data, such as graphs that can yield important information on the modelled …

    lethbridge Repository record for Graph decomposition algorithms for analyzing social and large complex networks (opens in a new tab)

  3. On vertex degrees, graph decomposition, and circular chromatic Ramsey number

    … vertex degrees and a variant of Ramsey number of graphs, and also structural problems about graph decomposition. In a list (d_1,...,d_n) of positive integers, let r and s denote the largest and smallest entries. A list is gap-free if each integer between r and s is present. In Chapter 2, we prove …

    uiuc Repository record for On vertex degrees, graph decomposition, and circular chromatic Ramsey number (opens in a new tab)

  4. The Topology of locally volume collapsed 3-Orbifolds

    … The main step of our proof is to construct a graph decomposition of sufficiently collapsed (closed) 3-orbifolds. We describe a coarse stratification of roughly 2-dimensional Alexandrov spaces which we then promote to a decomposition into suborbifolds for collapsed 3-orbifolds; this …

    lmu-germany Repository record for The Topology of locally volume collapsed 3-Orbifolds (opens in a new tab)

  5. Operads and moduli spaces

    … moduli spaces, in particular deducing a Mobius graph decomposition of the moduli spaces of Klein surfaces, analogous to the ribbon graph decomposition of the moduli spaces of Riemann surfaces. We also begin a study, in generality, of quantum homotopy algebras, which arise as 'higher genus' …

    lancaster

  6. Advanced hybrid approaches based on graph theory decomposition, modified evolutionary algorithms and deterministic optimisation techniques for the design of water distribution systems.

    … optimization methods with the incorporation of graph decomposition techniques. The most novel feature of this research is that graph decomposition techniques have been successfully incorporated to facilitate the optimization for WDS design. A number of decomposition techniques have been …

    adelaide Repository record for Advanced hybrid approaches based on graph theory decomposition, modified evolutionary algorithms and deterministic optimisation techniques for the design of water distribution systems. (opens in a new tab)

  7. Graph decompositions and variance balanced block designs of experiments

    … When the errors are correlated, we introduce graph theory to study construction methods of VBDs. We develop new methods via graph decomposition. In addition, we construct block designs such that the covariance matrix of the least squares estimator of treatment effects is completely symmetric. …

    uvic Repository record for Graph decompositions and variance balanced block designs of experiments (opens in a new tab)

  8. ON GRAPH DECOMPOSITIONS AND DESIGNS: EXPLORING THE HAMILTON-WATERLOO PROBLEM WITH A FACTOR OF 6-CYCLES AND PROJECTIVE PLANES OF ORDER 16

    This dissertation tackles the challenging graph decomposition problem of finding solutions to the uniform case of the Hamilton-Waterloo Problem (HWP). The HWP seeks decompositions of complete graphs into cycles of specific lengths. Here, we focus on cases with a single factor of 6-cycles. The …

    mtu Repository record for ON GRAPH DECOMPOSITIONS AND DESIGNS: EXPLORING THE HAMILTON-WATERLOO PROBLEM WITH A FACTOR OF 6-CYCLES AND PROJECTIVE PLANES OF ORDER 16 (opens in a new tab)

  9. On Induced Subgraphs, Degree Sequences, and Graph Structure

    Finally, we define the A4-structure H of a graph G to be the 4-uniform hypergraph on the vertex set of G where four vertices comprise an edge in H if and only if they form the vertex set of an alternating 4-cycle in G. Our definition is a variation of the notion of the P4-structure, a hypergraph …

    uiuc Repository record for On Induced Subgraphs, Degree Sequences, and Graph Structure (opens in a new tab)

  10. A distributed, compact routing protocol for the Internet

    … protocol for Cowen routing, using the k-core graph decomposition. Previous compact routing work showed the k-core graph decomposition is useful for Cowen Routing on the Internet, but no distributed form existed. This dissertation gives a distributed k-core algorithm optimised to be efficient …

    glasgow Download PDF for A distributed, compact routing protocol for the Internet (opens in a new tab)

  11. Efficiently computing graph similarity and graph connectivity

    … their relationships can often be modeled as a graph G = (V,E) such that entities of interest are represented by vertices in V and their relationships are represented by edges in E. With the proliferation of graph applications, such as physics, chemistry, biology, social networks, information …

    unsw Repository record for Efficiently computing graph similarity and graph connectivity (opens in a new tab)

  12. Mathematical problems in comparative genomics

    … recovering the phylogeny of species, I develop a graph decomposition theory to effectively reduce the size of the median problem, which lies at the heart of the rearrangement based phylogeny problem and has been proven NP-hard. My decomposition theory enables recursive reductions of the size of …

    ottawa-retro Repository record for Mathematical problems in comparative genomics (opens in a new tab)

  13. Structural Entropy-based Methods in Graph Representation Learning

    … of Structural Entropy (SE) based methods on Graph Representation Learning (GRL), a popular approach in graph processing within Artificial Intelligence. GRL methods aim to provide encoder functions that generate vectorized representations of graphs. These methods consist of three key …

    auckland-ms Repository record for Structural Entropy-based Methods in Graph Representation Learning (opens in a new tab)

  14. Scalable analytics of massive graphs

    Graphs are commonly selected as a model of scientific information: graphs can successfully represent imprecise, uncertain, noisy data; and graph theory has a well-developed mathematical apparatus forming a solid and sound foundation for graph research. Design and experimental confirmation of new, …

    uvic Repository record for Scalable analytics of massive graphs (opens in a new tab)

  15. On the independent spanning tree conjectures and related problems

    … (edge-)disjoint. The relationship between graph (edge-)connectivity and the existence of (edge-)independent spanning trees is explored. The (Edge-)Independent Spanning Tree Conjecture states that every k-(edge-)connected graph has k-(edge-)independent spanning trees with arbitrary root. We …

    gatech Repository record for On the independent spanning tree conjectures and related problems (opens in a new tab)

  16. Algebraic and semi-algebraic invariants on quadrics

    … terms of properties on the corresponding simple graphs. Our main theorem is the graph decomposition theorem that provides a bound on the regularity of a quadratic monomial ideal. By combining the main theorem with results in structural graph theory, we proved, improved, and generalized many of …

    gatech Repository record for Algebraic and semi-algebraic invariants on quadrics (opens in a new tab)

  17. Computational Methods for Discovering and Analyzing Causal Relationships in Health Data

    … from data. However, the number of candidate graphs grows in a more than exponential rate with the increase of variables. Exact learning for obtaining the optimal structure is thus computationally infeasible in practice. As a result, heuristic approaches are imperative to alleviate the …

    unt Repository record for Computational Methods for Discovering and Analyzing Causal Relationships in Health Data (opens in a new tab)

  18. On graph decompositions: Exploring the stars and stripes problem with odd n-stars

    … the “Stars and Stripes" problem, which is a graph decomposition problem. The Stars and Stripes problem can be described as finding uniformly resolvable decompositions when the blocks are either $n$-stars or edges. In other words, this refers to decomposing a complete graph into spanning …

    mtu Repository record for On graph decompositions: Exploring the stars and stripes problem with odd n-stars (opens in a new tab)

  19. Cost/revenue allocation on networks

    … pro- gramming, combinatorial optimization and graph theory, as well as methodology devel- oped in game theory. In Chapter 2, two related cost allocation problems arising from circular networks, namely, traveling salesman cost allocation and construction cost allocation, are anal- ysed. In …

    ubc Repository record for Cost/revenue allocation on networks (opens in a new tab) Download PDF for Cost/revenue allocation on networks (opens in a new tab)

  20. Biological sequence analyses - Theory, algorithms, and applications

    … anchor sequences are aligned using efficient graph theoretic algorithms. ClustalW is used for closing the gaps. The experiments showed that the algorithms can correctly find the alignment, and the longest path algorithm is more efficient than the maximum clique algorithm. The comparison with …

    nebraska Repository record for Biological sequence analyses - Theory, algorithms, and applications (opens in a new tab)

Page 1 of 3