The complexity of finding small separators in temporal graphs.
Philipp ZschocheTill FluschnikHendrik MolterRolf NiedermeierPublished in: J. Comput. Syst. Sci. (2020)
Keyphrases
- temporal constraints
- worst case
- small number
- database
- temporal information
- spatial and temporal
- computational cost
- maximum clique
- temporal data
- temporal analysis
- temporal consistency
- bounded treewidth
- temporal relations
- graph representation
- polynomial time complexity
- graph partitioning
- graph databases
- graph model
- temporal patterns
- weighted graph
- graph theory
- temporal reasoning
- np hard
- computational complexity
- video sequences
- image sequences
- data sets