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 6 of 6 for “"Paths in Graphs"”.
-
Circuits, Perfect Matchings and Paths in Graphs
We primarily consider the problem of finding a family of circuits to cover a bidgeless graph (mainly on cubic graph) with respect to a given weight function defined on the edge set. The first chapter of this thesis is going to cover all basic concepts and notations will be used and a survey of this …
-
Stratigraphic sedimentary inversion using paths in graphs
The problem of Stratigraphic Sedimentary Inversion consists of analysing quantities of given sediments deposited in sampled regions of a depositional space and calculating the total volumes that are necessary to match the sampled data in a forward depositional simulation. This is a central problem …
-
Finding Patterns, Short Cycles and Long Shortest Paths in Graphs
This thesis is about finding useful structures in a graph using fast algorithms, or showing that no such fast algorithms exist using popular fine-grained hypotheses from the field of Fine-Grained Complexity. These structures can be any small fixed-sized pattern, or more specific bigger structures …
-
Representing shortest paths in graphs using Bloom filters without false positives and applications to routing in computer networks
A Bloom filter is data structure for representing sets in a compressed form, which has many applications. Bloom filters save time and space, but produce errors known as false positives. In this thesis, a new approach is suggested. Instead of choosing labels for edges in graphs at random (as is done …
-
Extremal problems on cycles, packing, and decomposition of graphs
In this thesis, we study extremal problems concerning cycles and paths in graphs, graph packing, and graph decomposition. We use “graph” in the general sense, allowing loops and multi-edges. The Chv´atal–Erd˝os Theorem states that every graph whose connectivity is at least its independence number …
-
Extremal Problems for Cycles, Paths and Set-Systems
This thesis consists of an introduction and five chapters, each devoted to a different combinatorial problem. What ties all problems considered in this thesis together is their extremal nature and the probabilistic point of view taken in their formulations or analysis. In the first three chapters …