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 626 for “"subgraph"”.

  1. Multiple Continuous Subgraph Query Optimization Using Delta Subgraph Queries

    … and evaluating multiple directed structural subgraph queries, i.e., those without highly selective predicates on the edges or vertices, continuously in a changing graph. Existing techniques focus on queries with highly selective predicates or are designed for evaluating a single query. As …

    waterloo Repository record for Multiple Continuous Subgraph Query Optimization Using Delta Subgraph Queries (opens in a new tab)

  2. Distributed Subgraph Enumeration

    Subgraph enumeration is a fundamental graph problem with many applications. However, existing algorithms for subgraph enumeration fall short in handling large graphs due to the computational hardness. In this work, we propose a general approach that solves subgraph enumeration in the distributed …

    unsw Repository record for Distributed Subgraph Enumeration (opens in a new tab)

  3. Set-Centric Subgraph Isomorphism

    We investigate techniques for accelerating subgraph isomorphism (SI). SI is the task of finding occurrences of a pattern graph in a target graph and relevant to many practical applications. Our key idea is to use set algebra based formulations of SI. This facilitates employing set data structures …

    ethz Repository record for Set-Centric Subgraph Isomorphism (opens in a new tab)

  4. Subgraph Density and Graph Clustering

    Graph clustering, also often referred to as network community detection, is an unsupervised learning task. It is the process of grouping vertices into sets of vertices that share common relations. Graph clustering is a pivotal topic in the field of network science. It has applications in various …

    toronto-retro Repository record for Subgraph Density and Graph Clustering (opens in a new tab)

  5. Subgraph classification through neighborhood pooling

    Subgraph classification is an emerging field in graph representation learning where the task is to classify a group of nodes (i.e., a subgraph) within a graph. Graph neural networks (GNNs) are the de facto solution for node, link, and graph-level tasks but fail to perform well on subgraph …

    uoit Repository record for Subgraph classification through neighborhood pooling (opens in a new tab)

  6. Cohesive Subgraph Computation in Graphs

    … data. Among them, mining and querying cohesive subgraph structure in massive networks is of great importance for a deeper understanding and better management of such networks. However, the massive graph volume and rapid evolution present huge challenges, which need highly efficient solutions. In …

    unsw Repository record for Cohesive Subgraph Computation in Graphs (opens in a new tab)

  7. Dense subgraph mining in probabilistic graphs

    … consider the problem of mining cohesive (dense) subgraphs in probabilistic graphs, where each edge has a probability of existence. Mining probabilistic graphs has become the focus of interest in analyzing many real-world datasets, such as social, trust, communication, and biological networks due …

    uvic Repository record for Dense subgraph mining in probabilistic graphs (opens in a new tab)

  8. Accelerating subgraph isomorphism search using graphlets

    … graph analytics, a critical challenge is the Subgraph Isomorphism (SI) search problem. This NP-complete problem identifies all exact embeddings of a smaller pattern graph within a massive data graph. While numerous heuristic algorithms have been proposed to accelerate this search, no single …

    qu-belfast Repository record for Accelerating subgraph isomorphism search using graphlets (opens in a new tab) Download PDF for Accelerating subgraph isomorphism search using graphlets (opens in a new tab)

  9. Scalable subgraph representation learning through simplification

    … prediction on graphs is a fundamental problem. Subgraph representation learning approaches (SGRLs), by transforming link prediction to graph classification on the subgraphs around the links, have achieved state-of-the-art performance in link prediction. However, SGRLs are computationally …

    uoit Repository record for Scalable subgraph representation learning through simplification (opens in a new tab)

  10. Densest Subgraph Discovery On The CPU

    The Densest Subgraph Discovery (DSD) problem is a prevalent problem in the field of graph mining, aiming to find the cohesive subgraph. Given a graph �� = (��,��) and an integer �� ≥ 2, the goal is to find a vertex sub- set �� ⊆ �� whose induced subgraph �� (��) maximizes the ��-clique density, …

    rowan Repository record for Densest Subgraph Discovery On The CPU (opens in a new tab)

  11. Partitioning algorithms for induced subgraph problems

    … problems that involve finding a large induced subgraph contained by each of two input graphs: the induced subgraph isomorphism problem and the maximum common induced subgraph problem. The MCSPLIT algorithms resemble forward-checking constrant programming algorithms, but use problem-specific …

    glasgow Repository record for Partitioning algorithms for induced subgraph problems (opens in a new tab) Download PDF for Partitioning algorithms for induced subgraph problems (opens in a new tab)

  12. Solving hard subgraph problems in parallel

    … art in exact, practical algorithms for finding subgraphs. We study maximum clique, subgraph isomorphism, and maximum common subgraph problems. These are widely applicable: within computing science, subgraph problems arise in document clustering, computer vision, the design of communication …

    glasgow Download PDF for Solving hard subgraph problems in parallel (opens in a new tab)

  13. Cohesive Subgraph Detection in Massive Networks

    … data. Among them, mining and querying cohesive subgraph structure in massive networks is of great importance for a deeper understanding and better management of such networks. However, the massive graph volume and rapid evolution present huge challenges, which need highly efficient solutions. In …

    unsw Repository record for Cohesive Subgraph Detection in Massive Networks (opens in a new tab)

  14. Scalable Subgraph Mining in a Big Graph

    Finding from a big graph those subgraphs that satisfy certain conditions is useful in many applications such as community detection and subgraph matching. These problems have a high time complexity, but existing systems to scale them are all IO-bound in execution. We propose the first truly …

    uab Repository record for Scalable Subgraph Mining in a Big Graph (opens in a new tab)

  15. Dual algorithms for the densest subgraph problem

    Dense subgraph discovery is an important primitive for many real-world graph mining applications. The dissertation tackles the densest subgraph problem via its dual linear programming formulation. Particularly, our contributions in this thesis are the following: (i) We give a faster width-dependent …

    gatech Repository record for Dual algorithms for the densest subgraph problem (opens in a new tab)

  16. Efficient Cohesive Subgraph Computation in Temporal Graphs

    … in analyzing such graphs is to identify cohesive subgraphs that capture tightly connected structures over time. Among various cohesion models, the k-core has emerged as a simple yet powerful abstraction, and its extension to temporal settings has attracted increasing attention in recent years. …

    unsw Repository record for Efficient Cohesive Subgraph Computation in Temporal Graphs (opens in a new tab)

  17. Discovering Densest Subgraph over Heterogeneous Information Networks

    Densest Subgraph Discovery (DSD) is a fundamental and challenging problem in the field of graph mining in recent years. The DSD aims to determine, given a graph G, the subgraph with the maximum density according to the specified definition. The existing algorithms mostly focus on finding the …

    unsw Repository record for Discovering Densest Subgraph over Heterogeneous Information Networks (opens in a new tab)

  18. Introduction to the Minimum Rainbow Subgraph problem

    … bioinformatics, we developed the Minimum Rainbow Subgraph problem (MRS problem): Given a graph $G$, whose edges are coloured with $p$ colours. Find a subgraph $F\\\\subseteq G$ of $G$ of minimum order and with $p$ edges such that each colour occurs exactly once. We proved that this problem is …

    qucosa-diss

Page 1 of 32