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 27 for “"sparse graphs"”.
-
Colouring sparse graphs
Contains fulltext : 208472.pdf (Publisher’s version ) (Open Access)
-
Domination in Sparse Graphs
Given a partition pi of V (G) with parts ( V1, V2, ... , V t). A pi-dominating set B is a dominating set that is the union of parts of pi. The pi-domination number gamma(G,pi) of G is the size of a smallest pi-dominating set. If each Vi in pi has size at most 2, we call pi a coupling of G and say …
-
Linear Orderings of Sparse Graphs
… 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 fills …
-
Colorings of sparse graphs and multigraphs
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-10-19 without embargo terms
-
Cavity-Based Approaches to Stochastic Dynamics on Sparse Graphs: From Ecological Systems to Epidemiological Inference
L'abstract è presente nell'allegato / the abstract is in the attachment
-
Representation learning for non-sequential data
… new models to learn representations for sets and graphs. Typically, data collections in machine learning problems are structured as arrays or sequences, with sequential relationships between successive elements. Sets and graphs both break this common mold of data collections that have been …
-
Sparse regularity and relative Szemerédi 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 extend the …
-
Shortest paths, Markov chains, matrix scaling and beyond : improved algorithms through the lens of continuous optimization
… perfect matching problems. In the case of sparse graphs, this provides the first running time improvement for these problems in over 25 years. *-- We initiate the study of solving linear systems involving directed Laplacian matrices, and devise an almost-linear time algorithm for this task. …
-
Characterization of Sparsity-aware Optimization Paths for Graph Traversal on FPGA
… graph 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 …
-
Perfect Recovery in Heterogeneous Stochastic Bicluster Models
… graph is partitioned into k disjoint subgraphs to maximize the sum of their densities. In our first solution approach, we show that underlying bicliques can be recovered with high probability by solving a particular semidefinite relaxation, provided the input graph is drawn from a …
-
High Performance Issues on Parallel Architectures
… algorithms maintain optimality for very large sparse graphs. We further examine the architecture's ability to handle basic image processing tasks as well as its potential to simulate other parallel architectures and theoretic models.</p>
-
The Analysis of Error Floor and Graphical Structure of LDPC Codes
… the Tanner graph of LDPC codes, one for Tanner graphs of general LDPC codes, and one tailored for Tanner graphs of practically important quasi cyclic (QC) protograph LDPC codes.We show that for sparse graphs, the proposed algorithms significantly outperform the existing techniques, in terms of …
-
Low latency queries on big graph data
… 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 separation …
-
D-colorable digraphs with large girth
… proved, nonconstructively, that there exist graphs that have both arbitrarily large girth and arbitrarily large chromatic number. This result, along with its proof, has had a number of descendants (D. Bokal, G. Fijavz, M. Juvan, P.M. Kayll and B. Mohar, <italic>The circular chromatic number …
-
D-colorable digraphs with large girth
… proved, nonconstructively, that there exist graphs that have both arbitrarily large girth and arbitrarily large chromatic number. This result, along with its proof, has had a number of descendants (D. Bokal, G. Fijavz, M. Juvan, P.M. Kayll and B. Mohar, <italic>The circular chromatic number …
-
On the Design, Analysis, and Implementation of Algorithms for Selected Problems in Graphs and Networks
… to the matrix multiplication approach for sparse graphs. We also provide a parallel implementation of the matrix multiplication approach that runs in polylogarithmic parallel time using a polynomial number of processors. We include an implementation profile to demonstrate the efficiency of …
-
Combinatorial Optimization On Massive Datasets: Streaming, Distributed, And Massively Parallel Computation
… massively parallel algorithm for connectivity on sparse graphs that improve upon the classical parallel PRAM algorithms for a large family of graphs. In the second part of the thesis, we consider submodular optimization and in particular two canonical examples of set cover and maximum coverage …
-
From graphs to matrices, and back : new techniques for graph algorithms
… minimum s-t cut in undirected graphs that gives the fastest known algorithms for these tasks. These algorithms are the first ones to improve the long-standing bound of O(n3/2') running time on sparse graphs; -- Multicommodity Flow Problems. We set forth a new method of speeding …
-
Efficient Robot Motion Planning in Cluttered Environments
… on the graph abstraction. A desirable graph is sparse allowing for fast search (fewer graph 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 …
-
Statistical inference on network data
… modeling and data mining on networks. Random graphs with given vertex degrees have been widely used as a model for many real-world complex networks. However, both statistical inference and analytic study of such networks present great challenges. In Chapter 2, we propose new sequential …
Page 1 of 2