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

  1. Graph mutation, graph distance, and graph gradient

    … for maintaining a network. Distance-based graph invariants are important criteria for network maintenance. A graph mutation is a change in the edge set of a graph, and a graph gradient is the change in a graph invariant after a mutation. We present the general concepts of discrete integral …

    msu Repository record for Graph mutation, graph distance, and graph gradient (opens in a new tab)

  2. Graph Inference and Graph Matching

    Graphs are widely used in many fields of research, ranging from natural sciences to computer and mathematical sciences. Graph inference is an area of intense research. In this dissertation, we propose several methodologies in graph inference. We focus on statistical inference using graph …

    jhu Repository record for Graph Inference and Graph Matching (opens in a new tab)

  3. Graph Locality Prefetcher for Graph Database

    … to improve the performance of accessing graph data representing large and complex networks. We represent complex networks as graphs, and queries amount to traversals on the graph. Unlike conventional memory hierarchies that exploit spatial and temporal locality, we observe that graph …

    waterloo Repository record for Graph Locality Prefetcher for Graph Database (opens in a new tab)

  4. Graph matching by graph neural network

    Graph matching or network alignment refers to the problem of matching two correlated graphs. This thesis presents a deep Q learning based method, which represents the matching process by a graph neural network. By breaking the symmetry, the parameterized graph neural network is able to capture a …

    uiuc Repository record for Graph matching by graph neural network (opens in a new tab)

  5. Quasi-Isometric Graph Simplification and Graph Centrality

    This thesis studies some theoretical aspects of graph simplifications. Graph simplifications are methods to transform a graph into a smaller representation such that computation on the simplified representation becomes more efficient while remaining reasonably accurate. The distance query is a …

    auckland-ms Repository record for Quasi-Isometric Graph Simplification and Graph Centrality (opens in a new tab)

  6. 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)

  7. Problems in Graph Coloring and Graph Structure

    … set in the plane, and let G be the intersection graph of F . We studied the chromatic number of the complement of G. We also studied the transversal number of F , where the transversal number is the minimum size of a set of points that intersects all convex sets in F .

    uiuc Repository record for Problems in Graph Coloring and Graph Structure (opens in a new tab)

  8. Graph-XLL: a graph library for extra large graph analytics on a single machine

    Graph libraries containing already-implemented algorithms are highly desired since users can conveniently use the algorithms off-the-shelf to achieve fast analyt- ics and prototyping, rather than implementing the algorithms with lower-level APIs. Besides the ease of use, the ability to efficiently …

    uvic Repository record for Graph-XLL: a graph library for extra large graph analytics on a single machine (opens in a new tab)

  9. On quantum graph theory: non-commutative graph theory

    This research paper aims to introduce quantum graphs to newcomers. We adopt a clear and concise linear algebraic approach to simplify the concepts of quantum graphs. Our main perspective is viewing a quantum graph as a quantum adjacency matrix operator on a finite-dimensional C*-algebra (which can …

    glasgow Repository record for On quantum graph theory: non-commutative graph theory (opens in a new tab) Download PDF for On quantum graph theory: non-commutative graph theory (opens in a new tab)

  10. Graph minor

    … Let G be a (k + 2)-connected non-(k - 3)-apex graph where k ≥ 2. If G contains three k-cliques, say L 1, L2, L3, such that |Li ∩ Lj| ≤ k - 2 (1 ≤ i < j ≤ 3), then G contains a Kk +2 as a minor. (2) Let G be a 6-connected claw-free graph. If delta(G) ≥ 7 and G contains three disjoint 5-cliques, …

    wvu Repository record for Graph minor (opens in a new tab)

  11. Graph Kernels

    As new graph structured data is constantly being generated, learning and data mining on graphs have become a challenge in application areas such as molecular biology, telecommunications, chemoinformatics, and social network analysis. The central algorithmic problem in these areas, measuring …

    lmu-germany Repository record for Graph Kernels (opens in a new tab)

  12. Graph Labelings

    Given an ordering of the vertices of a graph around a circle, a page is a collection of edges forming non-crossing chords. A book embedding is a circular permutation of the vertices together with a partition of the edges into pages. The pagenumber t (G) is the minimum number of pages in a book …

    uiuc Repository record for Graph Labelings (opens in a new tab)

  13. Graph designs

    … su immersioni, colorazioni e metamorfosi di Graph Designs e una applicazione alle reti.

    catania Repository record for Graph designs (opens in a new tab)

  14. Computing Graph Metrics and Graph Properties with SQL Queries

    Within big data analytics, graph problems are as important as machine learning. There exist many algorithms to analyze large graphs, but they are limited by main memory. On the other hand, a lot of data stored on DBMSs needs to be analyzed as graphs. Moreover, DBMSs can work in parallel, and they …

    houston Repository record for Computing Graph Metrics and Graph Properties with SQL Queries (opens in a new tab)

  15. Interpretable graph distribution representation learning for graph optimization problems

    Graph optimization problems (GOPs) are fundamental in both graph theory and artificial intelligence (AI), playing an important role in various real-world applications and motivating researchers to develop approaches to address them. With advancements in machine learning (ML), particularly deep …

    ubc Repository record for Interpretable graph distribution representation learning for graph optimization problems (opens in a new tab) Download PDF for Interpretable graph distribution representation learning for graph optimization problems (opens in a new tab)

  16. Graph Attention Networks for Graph Learning and Its Applications

    … and investigates the recent development of graph attention network (GAT) models in the three following aspects: (1) GATs on single graph learning via the Knowledge Graph Embeddings (KGE) task, (2) GATs on multiple graph learning via the Cross-lingual Entity Alignment (CEA) task, and (3) GATs …

    york Repository record for Graph Attention Networks for Graph Learning and Its Applications (opens in a new tab)

  17. Hierarchical Hyperbolicity of Graph Products and Graph Braid Groups

    … variety of groups and spaces. We show that any graph product of finitely generated groups is hierarchically hyperbolic relative to its vertex groups. We apply this to answer two questions of Genevois about the electrification of a graph product of finite groups. We also answer two questions of …

    cuny-grad Repository record for Hierarchical Hyperbolicity of Graph Products and Graph Braid Groups (opens in a new tab)

  18. Structure-aware graph representation learning using graph neural networks

    Graph Neural Networks (GNNs) have emerged as powerful tools for learning representations from graph-structured data across diverse domains. However, existing GNN architectures often fail to adequately capture critical structural properties that fundamentally influence both the quality and fairness …

    iastate Repository record for Structure-aware graph representation learning using graph neural networks (opens in a new tab)

Page 1 of 734