The Computational Complexity of Finding Separators in Temporal Graphs.
Philipp ZschocheTill FluschnikHendrik MolterRolf NiedermeierPublished in: CoRR (2017)
Keyphrases
- computational complexity
- maximum clique
- special case
- np complete
- temporal information
- spatio temporal
- temporal consistency
- temporal evolution
- computational efficiency
- computationally efficient
- neural network
- storage requirements
- graph theory
- rate distortion
- temporal dimension
- np hard
- high computational complexity
- temporal databases
- spatial and temporal
- temporal patterns
- weighted graph
- graph matching
- space time
- bit rate
- video sequences