Efficient Subgraph Search in Time-Dependent Networks
Loading...
Authors
Sullivan, Everett
Issue Date
Type
Thesis
Language
en_US
Keywords
Alternative Title
Abstract
Subgraph search is a problem that has long been studied in computer science and a number of algorithms have been designed to preform this task completely. Variations on this problem have included multi-graphs, colored edges and vertices, and hypergraphs among others. A network can be described as a graph, and as that network changes over time, these changes can also be modeled as a graph. In this paper we show how existing algorithms can be made more efficient when preforming subgraph search on a time dependent network.
Description
Citation
Publisher
Clayton State University