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 80 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 …
-
Transversal Problems In Sparse Graphs
… graph $G$ which intersects all copies of subgraphs~$F$ from a fixed family $\mathcal F$. In the first portion of this thesis we show two results related to even cycle transversal. %%Note rephrase this later. In Chapter \ref{ECTChapter}, we present our 47/7-approximation for even cycle …
-
Resource Allocation on Sparse Graphs
Considering a network of workers represented by a sparse graph where each worker (ie. node) has a specific load of small independent jobs, our aim is to move the jobs around such that all tasks will be carried out while the communication is minimized. We examine the performance of a new algorithm …
-
Massively parallel algorithms for sparse graphs
Most real-life graphs are large and sparse, consisting of billions of nodes connected by billions of edges. Single-machine computation for such graphs is often slow and inefficient. The modern approach is to deploy a fleet of machines that work on a given graph problem in parallel. The Massively …
-
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
-
Safe Semi-Supervised Learning with Sparse Graphs
There has been substantial interest from both computer science and statistics in developing methods for graph-based semi-supervised learning. The attraction to the area involves several challenging applications brought forth from academia and industry where little data are available with training …
-
Analytic properties of sparse graphs and hypergraphs
… Next, we define a class of weighted hypergraphs that satisfy relative counting and removal lemmas. Finally, we present number theoretical and algorithmic applications of the aforementioned results.
-
Accelerating transitive closure of large-scale sparse graphs
… of real-world systems are typically sparse in nature due to lesser connectivity between nodes. The anti-section approach is designed specifically to improve performance for large scale sparse graphs. The NVIDIA Titan V CPU is used for the execution of the anti-section parallel …
-
A Faster Breadth-First Search on Sparse Graphs
… level-synchronous approach works well for dense graphs, where each level is relatively large, but its synchronization requirements limit performance on sparse graphs. Unordered BFS algorithms instead explore graphs without the level constraint, thus removing the synchronization barrier, at the …
-
Algorithms, parallelism and fine-grained complexity for shortest path problems in sparse graphs
… find a path of minimum weight from s to t. Most graphs that commonly occur in practice are sparse graphs. In this work, we deal with several computational problems related to shortest paths in sparse graphs and we present algorithms that provide significant improvements in performance in both …
-
Edge colorings of graphs on surfaces and star edge colorings of sparse graphs
… on two types of edge coloring problems for graphs. For each surface Σ, we define ∆(Σ) = max{∆(G)| G is a class two graph with maximum degree ∆(G) that can be embedded in Σ}. Hence Vizing’s Planar Graph Conjecture can be restated as ∆(Σ) = 5 if Σ is a sphere. For a surface Σ with …
-
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
-
Expander Graphs and Coding Theory
Expander graphs are highly connected sparse graphs which lie at the interface of many different fields of study. For example, they play important roles in prime sieves, cryptography, compressive sensing, metric embedding, and coding theory to name a few. This thesis focuses on the connections between …
-
Edge modification on perfect and reducible graphs with application to watermarking
… to edge modification problems on classes of graphs. For the theoretical part, we study and present polynomial algorithms for the minimum completion problem (i) of a graph with a “tail” for four subclasses of perfect graphs and (ii) of a graph and an added edge for the class of P4-sparse …
-
Quantum information dynamics in many-body systems
… I study tensor network states defined on generic sparse graphs. Using the intuition that generic graphs are locally tree-like, I develop efficient numerical methods to access local information of such states, which serve as a pathway for studying quantum many-body physics on sparse graphs beyond …
-
Development of a branch and price approach involving vertex cloning to solve the maximum weighted independent set problem
… for standard instances and randomly generated graphs for comparison. We show analytically and computationally that our approach gives tight bounds and it solves both dense and sparse graphs quite quickly.
-
Parameterized Approaches for Large-Scale Optimization Problems
… including: the maximum clique problem in sparse graphs; 0-1 programs with many conflicts; and the node-weighted Steiner tree problem with few terminal nodes. We also study polyhedral counterparts to fixed-parameter tractable algorithms. Specifically, we provide fixed-parameter tractable …
-
Theory and Applications of Mixed-Integer Fractional Programming
… combinatorial approach best suitable for sparse graphs. Finally, propose an extension of knapsack problems with fractional objectives arising from applications in service systems design and facility location problems with congestion.
Page 1 of 4