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 176 for “"large graphs"”.

  1. Substructures in large graphs

    … address concerns Hamilton cycles. Suppose G is a large digraph in which every vertex has in- and outdegree at least |G|/2. We show that G contains every orientation of a Hamilton cycle except, possibly, the antidirected one. The antidirected case was settled by DeBiasio and Molla. Our result is …

    birmingham Download PDF for Substructures in large graphs (opens in a new tab)

  2. Precise Partitions Of Large Graphs

    … on the existence of path decomposition of graphs with fixed start vertices and fixed lengths. We prove this conjecture when |G| is large. Our proof uses the Regularity Lemma along with several extremal lemmas, concluding with an absorbing argument to retrieve misbehaving vertices. …

    gsu Repository record for Precise Partitions Of Large Graphs (opens in a new tab)

  3. Flow analytics in large graphs

    … and difficulties, most notably the potentially large graph size and huge number of interactions between the vertices of the TIN. Another issue is that solutions to well-studied problems in graphs, such as max-flow computation in static networks, cannot directly be applied to solve flow …

    greece Repository record for Flow analytics in large graphs (opens in a new tab)

  4. Bisimulation-based Structural Summaries of Large Graphs

    … heterogeneous entity descriptions available as large graphs that grow to millions of nodes and billions of edges, it is a challenge to understand, explore, and query these large graphs. Bisimulation-based structural summaries have often been used as a compact representation of the dataset that …

    toronto-retro Repository record for Bisimulation-based Structural Summaries of Large Graphs (opens in a new tab)

  5. Efficient Reachability Query Processing in Large Graphs

    … and open challenges. Second, it delivers a large-scale empirical evaluation across diverse synthetic and real-world graphs and 38K+ query configurations, introducing a unified cost-performance metric and feature-driven guidance (via decision trees) to select methods under space/time …

    unsw Repository record for Efficient Reachability Query Processing in Large Graphs (opens in a new tab)

  6. Distributed Memory Processing of Very Large Graphs

    Big graphs such as social networks or the internet network, biological networks, knowledge graphs appear in many domains. However, processing these graphs rely on the accessibility of high-performance frameworks which are able to handle these large graphs. One aspect of this accessibility is the …

    oregon Repository record for Distributed Memory Processing of Very Large Graphs (opens in a new tab)

  7. Efficient Detection of Overlapping Communities in Large Graphs

    … detection of overlapping communities in large graphs. Only super-fast local algorithms like Louvain are really practical for very large datasets, but they tend to give hierarchical rather than overlapping partitions. We develop some techniques that let you get reasonable families of …

    ottawa-retro Repository record for Efficient Detection of Overlapping Communities in Large Graphs (opens in a new tab)

  8. Spectral embedding of large graphs and dynamic networks

    The analysis of network data, describing relationships, interactions and dependencies between entities, often begins with embedding: the process of mapping these entities into a low-dimensional vector space in a way which preserves salient information present in the data. Spectral embedding is a …

    bristol Repository record for Spectral embedding of large graphs and dynamic networks (opens in a new tab) Download PDF for Spectral embedding of large graphs and dynamic networks (opens in a new tab)

  9. Mining maximal cliques from large graphs using MapReduce

    … within a graph, and has found applications in graphs arising in biological and chemical networks, and more. While MCE is well studied in the sequential case, a single machine can no longer process large graphs arising in today's applications, and effective ways are needed for processing these …

    iastate Repository record for Mining maximal cliques from large graphs using MapReduce (opens in a new tab)

  10. Interactive graph layout: The exploration of large graphs.

    Directed and undirected graphs provide a natural notation for describing many fundamental structures of computer science. Unfortunately graphs are hard to draw in an easy to read fashion. Traditional graph layout algorithms have focused on creating good layouts for the entire graph. This approach …

    arizona-thes Repository record for Interactive graph layout: The exploration of large graphs. (opens in a new tab)

  11. Cohesive Subgraph Detection and Search in Large Graphs

    Graphs are widely used to model complex networks in real-world applications. The identification and search for cohesive subgraphs are fundamental tasks in graph analysis. Despite the many models proposed to measure subgraph cohesiveness and solve tasks, there are notable gaps in the research. …

    unsw Repository record for Cohesive Subgraph Detection and Search in Large Graphs (opens in a new tab)

  12. Scalable algorithms for correlation clustering on large graphs

    … memory and run time bottlenecks when applied to larger graphs. Several algorithms with the best theoretical guarantees for clustering quality need to first solve a relatively large linear program; others perform brute-force searches over sizeable sets, or store large amounts of unnecessary …

    bu Repository record for Scalable algorithms for correlation clustering on large graphs (opens in a new tab)

  13. An experimental study of partitioning methods for large graphs

    … systems can be represented in the forms of graphs. <em>Partitioning</em> a given problem to be processed on a parallel system can therefore be reduced to partitioning its representative graph. Graph coarsening is a technique in which a large graph hav-ing many thousands to millions of …

    ut-knoxville Repository record for An experimental study of partitioning methods for large graphs (opens in a new tab)

  14. I/O efficient cohesive subgraph search in large graphs

    … search has been recently studied for its large number of applications in social networks, web search, collaboration networks, and biology. Most existing approaches for cohesive subgraph search assume that the graph is kept in memory of a machine. However, many real-world graphs are big and …

    unsw Repository record for I/O efficient cohesive subgraph search in large graphs (opens in a new tab)

  15. K-edge Connected Components in Large Graphs: An Empirical Analysis

    Graphs play a pivotal role in representing complex relationships across various domains, such as social networks and bioinformatics. Key to many applications is the identification of communities or clusters within these graphs, with k-edge-connected components emerging as an important method for …

    uvic Repository record for K-edge Connected Components in Large Graphs: An Empirical Analysis (opens in a new tab)

  16. Hamilton cycles in large graphs and hypergraphs: existence and counting

    … In Chapter 2, we prove that \( k \)-uniform hypergraphs satisfying a `Dirac-like' condition on the minimum \( (k-1) \)-degree contain many of a natural hypergraph analogue of a Hamilton cycle. In Chapter 3, we show that almost all optimal edge-colourings of \( K_{n} \) admit a Hamilton path whose …

    birmingham Download PDF for Hamilton cycles in large graphs and hypergraphs: existence and counting (opens in a new tab)

  17. Efficiently Answering Quality Constrained Shortest Distance Queries in Large Graphs

    The shortest-path distance is a fundamental concept in graph data analytics and has been extensively studied in literature. In many real-world applications, quality constraints are naturally associated with edges in the graph, and finding the shortest distance between vertices along only valid …

    unsw Repository record for Efficiently Answering Quality Constrained Shortest Distance Queries in Large Graphs (opens in a new tab)

Page 1 of 9