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 324 for “"Graph algorithms"”.
-
Functional programming and graph algorithms
This thesis is an investigation of graph algorithms in the non-strict purely functional language Haskell. Emphasis is placed on the importance of achieving an asymptotic complexity as good as with conventional languages. This is achieved by using the monadic model for including actions on the …
-
MULTI-CORE PARALLEL GRAPH ALGORITHMS
Large sizes of real-world data graphs, such as social networks, communication networks, hyperlink networks, and model-checking networks, call for fast and scalable analytic algorithms. The shared-memory multicore machine is a prevalent parallel computation model that can handle such volumes of …
-
Towards Performance Portable Graph Algorithms
… making the processing of large-scale graphs in an architecture agnostic manner crucial. Traditionally, hand-optimized high-performance computing (HPC) solutions have been studied and used to implement highly efficient and scalable graph algorithms. In recent years, several graph …
-
Complex graph algorithms using relational database
… In this dissertation, we study three fundamental graph problems in RDBMS. The first problem we tackle is computing shortest paths (SP) from a source to a target in large network graphs. We explore SQL based solutions and leverage the intelligent scheduling that a RDBMS performs when executing …
-
Graph algorithms for the haplotyping problem
Evidence from investigations of genetic differences among human beings shows that genetic diseases are often the results of genetic mutations. The most common form of these mutations is single nucleotide polymorphism (SNP). A complete map of all SNPs in the human genome will be extremely valuable …
-
Faster graph algorithms via switching classes
… that the runtimes of the first generation of graph algorithms were expressed as functions of n := |V|. This analysis was natural since at this time graphs were represented in n2 space via their adjacency matrix. It was soon noticed that if m := |E| = o(n2), then a variety of graph algorithms …
-
Designing Functional Implementations of Graph Algorithms
Classic graph algorithms are usually presented and analysed in imperative programming languages. Imperative programming languages are well-suited for the description of a program flow, in which the order in which the operations are performed is important. One common example of such a description is …
-
Problems in Sorting and Graph Algorithms
… problem concerns the determination of optimal algorithms with respect to a new model for evaluating sorting algorithms. We did an exhaustive search for such algorithms. The second problem concerns a conjecture that every sorting algorithm on some input involves every key in O(log n) …
-
Scalable Graph Algorithms with Applications in Genetics
<p>Graph theoretical approaches have been widely used to solve problems arising in bioinformatics and genomic analysis. In particular, enumeration problems such as maximal clique and maximal biclique finding are cores for addressing many biological problems, such as the integration of genome …
-
Novel Graph Algorithms for Life Science Applications
<p>Modern life sciences increasingly leverage graph-theoretic models to untangle complex biological relationships; however, existing algorithms often struggle with the scale and heterogeneity of life science data. This dissertation addresses these challenges by developing and applying advanced …
-
Synchronization-avoiding graph algorithms and runtime aspects
… in the programming practice because it makes algorithms easier to design and implement. However, irregular applications such as graph algorithms can suffer performance bottlenecks due to the straggler effect induced by global and vertex-centric barriers. In the effort to eliminate barriers, we …
-
Sparse Graph Algorithms For Analytics And Prediction Tasks
Graphs are ubiquitously used to model large-scale real-world data in our everyday lives. With the growing sizes of these graphs and their expanding application to various tasks, there has been an increasing interest in creating efficient graph algorithms and processing systems. Historically, …
-
Cache-Efficient Graph Algorithms for Near Neighbor Search
Graph search has recently become one of the most successful algorithmic trends for near neighbor search. Several of the most popular and empirically successful algorithms are, at their core, a simple walk along a pruned near neighbor graph. Such methods consistently outperform other approaches and …
-
On designing structure-aware high-performance graph algorithms
Graph algorithms find several usages in industry, science, humanities, and technology. The fast-growing size of graph datasets in the context of the processing model of the current hardware has resulted in different bottlenecks such as memory locality, work-efficiency, and load-balance that degrade …
-
Graph Algorithms Over Homomorphic Encryption for Data Cooperatives
… Next, this work implements a federated graph storage technique for a graph database that works symbiotically with the novel HE query watchdog. This watchdog enforces k-anonymity (via rules derived from the privacy policy) on top of HE and ensures no query that violated k-anonymity along …
-
Efficient String and Graph Algorithms in Modern Settings
… distance have been well-studied for decades, and algorithms for these problems have become established and widespread. In modern times, however, achieving even faster algorithms for more specific scenarios finds increasing value as dataset sizes become larger and computer application settings …
-
Mapping parallel graph algorithms to throughput-oriented architectures
… high-performance computing especially crucial. Graphics Processing Units (GPUs) have recently become an exciting alternative to traditional CPU architectures for applications in this domain. Although GPUs are designed for rendering graphics, research has found that the GPU architecture is …
Page 1 of 17