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 15 of 15 for “"Dense Graphs"”.
-
The Chromatic Structure of Dense Graphs
… well as the lower bound for the clique number of graphs that have some fixed edge density and no induced K_{2, t}. The next three chapters form the heart of the thesis. Chapters 3 and 4 consider the Erdős-Simonovits question for locally r-colourable graphs: what are the structure and chromatic …
-
Approximating cutnorm: A robust method to compute distance between dense graphs for prediction and interpretation
… thesis presents techniques of modeling large and dense networks and methods of computing distances between them. Large and dense networks arise in many disciplines. Through recent advancements in dense graph theory and graph convergence, we have a new perspective on how large graphs should be …
-
Characterization of Sparsity-aware Optimization Paths for Graph Traversal on FPGA
… datasets. Optimizations intended for sparse graphs may not work as effectively for dense graphs on an FPGA and vice versa. This thesis presents two sets of FPGA optimization strategies for BFS, one for near-hypersparse graphs and the other designed for sparse to moderately dense graphs. For …
-
Spectral sparsification and spectrally thin trees
… trees and unweighted spectral sparsifiers for graphs with small expansion. In addition, we also survey and prove some partial results on the existence of spectrally thin trees on dense graphs with high enough expansion.
-
Low latency queries on big graph data
… meeting these goals is impossible for extremely dense graphs. The central theme of this dissertation is to show that these goals can, in fact, be achieved by exploiting {\em graph sparsity}, a property almost always encountered in big graph data. This dissertation formally establishes a …
-
Sparse regularity and relative Szemerédi theorems
… combinatorial theorems and techniques from the dense setting to the sparse setting. First, we consider Szemerédi regularity lemma, a fundamental tool in extremal combinatorics. The regularity method, in its original form, is effective only for dense graphs. It has been a long standing problem to …
-
Discrepancy Inequalities in Graphs and Their Applications
… use of eigenvalues of matrices associated with graphs, is a modern technique that has expanded our understanding of graphs and their structure. A particularly useful tool in spectral graph theory is the Expander Mixing Lemma, also known as the discrepancy inequality, which bounds the edge …
-
On approximating projection games
… cases of projection games where the underlying graphs belong to certain families of graphs. For planar graphs, we present both a subexponential-time exact algorithm and a polynomial-time approximation scheme (PTAS) for projection games. We also prove that these algorithms have tight running …
-
Matchings, matroids and submodular functions
… maximum cardinality matchings in non-bipartite graphs. Our algorithm requires O(n") time in graphs with n vertices, where w < 2.38 is the matrix multiplication exponent. This algorithm achieves the best-known running time for dense graphs, and it resolves an open question of Mucha and Sankowski …
-
Linear Orderings of Sparse Graphs
… both problems have been studied intensively on dense graphs and tournaments, not much is known about their structure and properties on sparser graphs. There are also only few approximative algorithms that give performance guarantees especially for graphs with bounded vertex degree. This thesis …
-
Generating Random Graphs with Tunable Clustering Coefficient
… clustering coefficient except for highly dense graphs, in which case the experimental clustering coefficient is higher than the anticipated value. THROW-2 chooses three distinct nodes for creating triangles and two distinct nodes for creating single edges, while they need not be distinct …
-
Efficient Robot Motion Planning in Cluttered Environments
… operations and edge evaluations) but locally dense in cluttered regions such that a feasible low-cost path exists. We note that there is structural similarity in the environments that a robot typically operates in. To this end, we propose LEGO, to leverage a robot's experience in similar …
-
Efficient visual navigation of hierarchically structured graphs
Visual navigation of hierarchically structured graphs is a technique for interactively exploring large graphs that possess an additional hierarchical structure. This structure is expressed in form of a recursive clustering of the nodes: in call graphs of telephone networks, for instance, the nodes …
-
Graph Neural Networks for Multi-Robot Coordination
… Search (CBS) in a non-grid setting, especially dense graphs. Our framework guarantees both the completeness and bounded suboptimality of the solution. For the explainability and interpretability for RL, we introduced a global path planning algorithm (for example, A*) to generate a globally …
-
Algorithmic Distribution of Applied Learning on Big Data
… no edge or overlap effects in structures such as graphs or matrices to resolve. This thesis focuses on key-value pair based distribution of applied machine learning techniques on a variety of problems. For the first method key-value pair distribution is used for storytelling at scale. Storytelling …