On the Computational Complexity of Vertex Integrity.
Pål Grønås DrangeMarkus Sortland DregiPim van 't HofPublished in: CoRR (2014)
Keyphrases
- computational complexity
- low complexity
- computationally efficient
- high computational complexity
- special case
- computational load
- np complete
- bit rate
- rate distortion
- undirected graph
- memory requirements
- computational efficiency
- directed graph
- decision problems
- computer vision
- database integrity
- explanatory power
- triangle mesh
- real world
- attributed graphs
- data integrity
- storage requirements
- data mining