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 8 of 8 for “"Dynamic graph algorithms"”.
-
Applications of a Novel Sampling Technique to Fully Dynamic Graph Algorithms
… of a novel sampling technique to building fully-dynamic randomized graph algorithms. We present the following results: \begin{enumerate} \item A randomized algorithm to estimate the size of a cut in an undirected graph $G = (V, E)$ where $V$ is the set of nodes and $E$ is the set of edges and $n …
-
Towards Dynamic Network Analysis: Benchmarks, Applications and Algorithms
Graphs are a fundamental abstraction for modeling complex systems, representing entities as vertices and relationships as edges across domains ranging from social networks and biological systems to High-Performance Computing infrastructures. Most real-world graphs are dynamic in nature, …
-
Algorithmic manipulation of probability distributions for networks and mechanisms
… four different works that solve problems in dynamic graph algorithms, spectral graph algorithms, computational economics, and differential privacy. While these areas are not all strongly correlated, there were similar techniques integral to each of the results. In particular, a key to each …
-
Development of a Decision Support Tool for Planning Rail Systems: An Implementation in TSAM
… of the network topology. Further, an event graph approach is used for analysis of the generated network. Shortest travel times and their corresponding travel costs between origin-destination pairs are found using Floyd's algorithm. Complete itineraries including transfers (if involved) are …
-
Two problems in dynamic graph analytics : maximum flow and online partitioning
… evolve quickly over time and can be modelled as dynamic graphs. Dynamic graph processing systems emerged to provide timely analysis on these graphs, ingesting graph updates through one or more streams, and providing (on-demand or regularly) answers to a standing query. This thesis explores both …
-
Asynchronous dynamic graph processing with real-time analysis
… transactions has led to the widespread use of graph-based representations for data analysis of these networks. However, traditional high-performance computing (HPC) solutions designed for static graphs are inefficient and impractical for dynamic graphs that evolve over time. This approach leads …
-
Efficient Data Structures for Partial Orders, Range Modes, and Graph Cuts
… partial order representation, range modes, and graph cuts. We consider two problems in partial order representation. The first is a data structure to represent a lattice. A lattice is a partial order where the set of elements larger than any two elements x and y are all larger than an element z, …
-
Κάλυψη συνόλου και βελτιστοποίηση δικτύων: δυναμικοί και προσεγγιστικοί αλγόριθμοι
… of set covering and network optimization algorithms.The content of the dissertation consists of three parts: Probabilistic Set Covering, Dynamic GraphAlgorithms, and Network Optimization. For the set covering problem we study the behavior of asimple algorithm in the most general …