Computational complexity of covering disconnected multigraphs.
Jan BokJirí FialaNikola JedlickováJan KratochvílMichaela SeifrtováPublished in: Discret. Appl. Math. (2024)
Keyphrases
- computational complexity
- np complete
- decision problems
- communication networks
- low complexity
- special case
- computational cost
- computationally efficient
- high computational complexity
- np hard
- pattern recognition
- computational efficiency
- worst case
- motion estimation
- rough sets
- information retrieval
- search algorithm
- data structure
- face recognition
- artificial intelligence