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 90 for “"Dynamic graphs"”.

  1. Preserving large cuts in fully dynamic graphs

    … the study of the MAX-CUT problem in fully dynamic graphs. Given a graph $G=(V,E)$, we present the first fully dynamic algorithms to maintain a $\frac{1}{2}$-approximate cut in sublinear update time under edge insertions and deletions to $G$. Our results include the following deterministic …

    uvic Repository record for Preserving large cuts in fully dynamic graphs (opens in a new tab)

  2. Real-time analytics on large dynamic graphs

    … number of applications is being modeled as dynamic graphs. The graph structure encodes relationships among data items, while the structural changes to the graphs as well as the continuous stream of information produced by the entities in these graphs make them dynamic in nature. Examples …

    maryland Repository record for Real-time analytics on large dynamic graphs (opens in a new tab)

  3. Estimating Reachability Set Sizes in Dynamic Graphs

    Graphs are a commonly used abstraction for diverse kinds of interactions, e.g., on Twitter and Facebook. Different kinds of topological properties of such graphs are computed for gaining insights into their structure. Computing properties of large real networks is computationally very challenging. …

    vt Repository record for Estimating Reachability Set Sizes in Dynamic Graphs (opens in a new tab)

  4. Implementing Quantum Gates With Length-3 Dynamic Graphs

    … equal to the adjacency matrix of a sequence of graphs, called a dynamic graph, continuous-time quantum walks have been shown to implement quantum gates, including the T gate, Hadamard gate, and the Controlled{NOT gate. Since these gates make up a universal set of quantum gates, they can …

    creighton Repository record for Implementing Quantum Gates With Length-3 Dynamic Graphs (opens in a new tab)

  5. Agglomerative clustering for community detection in dynamic graphs

    … maximization have been developed for static graphs. However, since many (contemporary) networks are not static but rather evolve over time, the static approaches are rendered inappropriate for clustering of dynamic graphs. Modularity optimization in changing graphs is a relatively new field …

    gatech Repository record for Agglomerative clustering for community detection in dynamic graphs (opens in a new tab)

  6. Parameterized Verification of Distributed Algorithms in Dynamic Graphs

    Problems set in dynamic graphs have recently been gaining more attention. However, automated verification methods for the proposed solutions to these problems have not yet been studied. We aim in this work to provide some first results in this direction by focusing on distributed algorithms set in …

    chalmers Repository record for Parameterized Verification of Distributed Algorithms in Dynamic Graphs (opens in a new tab)

  7. Kernel-based Reconstruction of Dynamic Functions over Dynamic Graphs

    … dierent time instants. Leveraging spatiotemporal dynamics and prior information can drastically reduce the number of observed vertices, and hence the cost of sampling. Alleviating the limited exibility of existing approaches, this thesis broadens the kernel-based graph function estimation …

    umn Repository record for Kernel-based Reconstruction of Dynamic Functions over Dynamic Graphs (opens in a new tab)

  8. Revealing evolutionary patterns in dynamic graphs: exploration and visualization techniques

    Graphs are a fundamental data structure used to model a wide range of complex systems, such as social networks, biological processes, and transportation systems. These graphs are often dynamic, evolving over time with changes in both their structure and attributes. This introduces significant …

    greece Repository record for Revealing evolutionary patterns in dynamic graphs: exploration and visualization techniques (opens in a new tab)

  9. Accelerating and Updating Reachability Indexing over Large and Dynamic Graphs

    … size and complexity of large-scale graphs, constructing a reachability index from scratch is becoming expensive and unreasonable. Additionally, rebuilding whole indexes with every change causes great overhead in terms of time and resources in dynamic graphs where updates occur …

    unsw Repository record for Accelerating and Updating Reachability Indexing over Large and Dynamic Graphs (opens in a new tab)

  10. Statistical signal processing on dynamic graphs with applications in social networks

    … different estimation and sensing problems over graphs with applications to social networks. The first part of this dissertation is devoted to multi-agent Bayesian estimation and learning problem in social networks. We consider a set of agents that interact over a network to estimate an unknown …

    ubc Repository record for Statistical signal processing on dynamic graphs with applications in social networks (opens in a new tab) Download PDF for Statistical signal processing on dynamic graphs with applications in social networks (opens in a new tab)

  11. Learning Effective Embeddings for Dynamic Graphs and Quantifying Graph Embedding Interpretability

    … capture the structure and features of large graphs. This is especially important because the quality of the graph representation vectors will affect the performance of these vectors in downstream tasks such as node classification and link prediction. Many techniques have been proposed for …

    york Repository record for Learning Effective Embeddings for Dynamic Graphs and Quantifying Graph Embedding Interpretability (opens in a new tab)

  12. Comparing internet probing methodologies through an analysis of large dynamic graphs

    … these by modeling union of traceroute outputs as graphs, and using standard graph theoretical measurements as well as a recently introduced measurement. Ultimately, the researchers verified the NPS’s probing methodology was comparable to the CAIDA’s probing methodology. We also propose additional …

    nps Repository record for Comparing internet probing methodologies through an analysis of large dynamic graphs (opens in a new tab)

  13. Efficient algorithms for some connectivity problems, in static and dynamic graphs

    … for some connectivity problems in undirected graphs, in the static, dynamic, and sensitivity setting. Our contribution can be summarized as follows. (1) We provide the first linear-time algorithms for computing the 4- and 5-edge-connected components in undirected multigraphs. This result …

    greece Repository record for Efficient algorithms for some connectivity problems, in static and dynamic graphs (opens in a new tab)

  14. Using PageRank Algorithm in Analyzing Dictionary Graphs and PageRank in Dynamic Graphs

    … thesis we are going to analyze the dictionary graphs and some other kinds of graphs using the PagerRank algorithm. We calculated the correlation between the degree and PageRank of all nodes for a graph obtained from Merriam-Webster dictionary, a French dictionary and WordNet hypernym and …

    brock Repository record for Using PageRank Algorithm in Analyzing Dictionary Graphs and PageRank in Dynamic Graphs (opens in a new tab)

  15. DANF: Approximate Neighborhood Function on Large Dynamic Graphs Continuously finding changes in node centrality

    … function measures node centrality in graphs by measuring how many nodes a given node can reach in a certain number of steps. The neighborhood function can for example be used to find central nodes or the degree of separation. The state-of-the-art algorithm, called HyperANF (Hyper …

    chalmers Repository record for DANF: Approximate Neighborhood Function on Large Dynamic Graphs Continuously finding changes in node centrality (opens in a new tab)

  16. Nonpreemptive Run-Time Scheduling Issues on a Multitasked, Multiprogrammed Multiprocessor With Dependencies, Bidimensional Tasks, Folding, and Dynamic Graphs

    … The model consists of directed, acyclic graphs, generated from serial FORTRAN benchmark programs by the parallel compiler Parafrase. A multitasked, multiprogrammed environment is created. Dependencies are generated by the compiler. Tasks are bidimensional, i.e., they may specify both time …

    uiuc Repository record for Nonpreemptive Run-Time Scheduling Issues on a Multitasked, Multiprogrammed Multiprocessor With Dependencies, Bidimensional Tasks, Folding, and Dynamic Graphs (opens in a new tab)

  17. Graph-based Analysis of Dynamic Systems

    The analysis of dynamic systems provides insights into their time-dependent characteristics. This enables us to monitor, evaluate, and improve systems from various areas. They are often represented as graphs that model the system's components and their relations. The analysis of the resulting …

    qucosa-diss

  18. Supporting Dynamic Queries and Annotations Over Data Graphs

    … such as those derived from social networks and dynamic distributed systems, we often need to associate metadata with whole subgraphs of data. In particular, provenance and trustworthinessare examples of metadata that can be associated to entire sugbraphs. To the extent of our knowledge, however, …

    uiuc Repository record for Supporting Dynamic Queries and Annotations Over Data Graphs (opens in a new tab)

Page 1 of 5