Computational Complexity of Covering Two-vertex Multigraphs with Semi-edges.
Jan BokJirí FialaPetr HlinenýNikola JedlickováJan KratochvílPublished in: CoRR (2021)
Keyphrases
- computational complexity
- directed graph
- undirected graph
- vertex set
- edge weights
- np complete
- high computational complexity
- np hard
- communication networks
- low complexity
- information retrieval
- minimum weight
- decision problems
- special case
- complex networks
- edge information
- spanning tree
- computational cost
- database
- straight edges
- edge detector
- rate distortion
- weighted graph
- computationally efficient
- case study
- minimum volume