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 47 for “"Temporal graphs"”.
-
Temporal graphs
This thesis studies Temporal Graphs, also called Temporal Networks. More specifically, the project aimed to carry out research on the properties of Temporal Graphs, both in general and in specific classes of the model, as well as examine and develop algorithms for solving problems in temporal graph …
-
Sequence queries on temporal graphs
Graphs that evolve over time are called temporal graphs. They can be used to describe and represent real-world networks, including transportation networks, social networks, and communication networks, with higher fidelity and accuracy. However, research is still limited on how to manage large scale …
-
Connectivity Query Processing in Temporal Graphs
The connectivity query in undirected graphs aims to determine if there exists a path connecting two query vertices, which is a fundamental task in both graph theory and real graph-driven tasks. The temporal graph has a time label for each edge and is commonly used to capture the interactions …
-
Efficient Cohesive Subgraph Computation in Temporal Graphs
Temporal graphs are widely used to model time-evolving interactions in real-world systems such as social networks, financial transaction networks, and communication networks. A fundamental task in analyzing such graphs is to identify cohesive subgraphs that capture tightly connected structures over …
-
Parameterised complexity of spreading problems on temporal graphs
… problems are a class of decision problems on graphs that can be used to model the behaviour of a spread of a contagion over a network. Real world networks are often dynamic in nature, with the connections between the members of the network changing over time. Take for example the contact …
-
Enhancing CHRONOGRAPH: Adaptive Integer Compression for Temporal Graphs
Καθώς τα χρονικά δεδομένα γράφων γίνονται όλο και μεγαλύτερα και πιο λεπτομερή, η ανάγκη για αποδοτικές τεχνικές συμπίεσης γίνεται επιτακτική, ώστε να μειωθεί ο χώ- ρος αποθήκευσης και να επιταχυνθεί η εκτέλεση ερωτημάτων. Το CHRONOGRAPH, ένα προηγμένο σύστημα συμπίεσης χρονικών γράφων, διαχωρίζει …
-
Motif-Driven Techniques for Temporal Graphs: Models and Applications
… protein interactions. Defined as limited-size subgraphs, motifs are important local structures that are often used for examining interactions among small sets of nodes in the networks. Motif-driven techniques are essential for revealing the basic building blocks and identifying frequent …
-
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 …
-
Resolving Temporal Graph Functional Dependency Violations
… as reported in 2016 by Harvard Business Review. Temporal graphs are used to record changes in graph data, capturing both topological and attribute value constraints and relationships. As data values change, snapshots of temporal graphs may become inconsistent with respect to a set of graph …
-
Stochastic Event Prediction in Social Networks
Temporal graphs in which events are active only at specific timestamps arise in many critical domains, such as social communication, transaction networks, biological pathways and financial systems. The complex and evolving interaction patterns in temporal graphs make it challenging to anticipate …
-
Enforcing Temporal and Ontological Dependencies Over Graphs
Graphs provide powerful abstractions, and are widely used in different areas. There has been an increasing demand in using the graph data model to represent data in many applications such as network management, web page analysis, knowledge graphs, social networks. These graphs are usually dynamic …
-
Generalizing graph decompositions
… There is a vast literature on how to do this on graphs. But often we need to compute on other structures (decorated graphs or perhaps algebraic objects such as groups) for which we do not have a wealth of decomposition methods. This thesis attacks this problem head on: we propose new …
-
Scalable Management and Analysis of Temporal Property Graphs
Graphs, as simple yet powerful data structures, play a pivotal role in modeling and analyzing relationships among real-world entities. In the data representation and analysis landscape, graph data structures have established themselves as a fundamental paradigm for modeling and understanding …
-
Community Detection using Locality Statistics
… methods of identifying an anomalous community in temporal graphs and another method of identifying active communities in a static massive graph. All methods are based on locality statistics. In [50], an anomalous community is detected that shows growing connectivities in a time series of graphs. …
-
Efficient Subgraph Computing on Large-Scale Graphs
The problem of efficiently computing subgraphs has received much attention from the database research community. In this thesis, we study important problem of efficient graph analysis at a large scale. Three subgraph computation problems are studied. These problems are (1) Triangle Listing, (2) …
-
Separation and Cover Problems in Temporal Graph
A graph that changes with time is called a temporal graph. In this work, we focus on temporal graphs whose vertex sets are fixed while edge sets change in discrete time steps. We use n to refer to the number of vertices in the graph and τ to refer to the total number of time steps over which a …
-
Theory and Applications of Conditional Entropy of Heat Diffusion on Temporal Networks
… framework for the study of static and temporal graphs based on the conditional entropy of heat diffusion, establishes its main theoretical properties, and demonstrates its usefulness for the analysis and structural interpretation of time-evolving networks. The main idea is to combine …
-
Event graph optimization in RFI text documents using hierarchical reinforcement learning and human feedback
… RCA approaches, many of which are based on event graphs, tend to rely on predefined rules or statistical correlations, which may not fully capture the dynamic and evolving nature of construction-related issues. To address these challenges, this study proposes a novel approach that integrates human …
-
Toward foundational advancements in temporal graph learning
Temporal graphs capture the evolving interactions that define financial systems, communication platforms, and social networks. Their continuously changing structure makes them difficult to model, yet understanding their evolution is essential for applications such as fraud detection, behavioral …
-
Efficient and trustworthy methods for knowledge discovery
… classification and community search in temporal graphs. Regarding multi-label classification, we propose an efficient and accurate rule-based multi-label classifier that drastically improves upon the interpretability of existing solutions. For community search in temporal graphs, we …
Page 1 of 3