On the computational complexity of upper distance fractional domination.
Johannes H. HattinghMichael A. HenningJakobus L. WaltersPublished in: Australas. J Comb. (1993)
Keyphrases
- computational complexity
- distance measure
- np hard
- memory requirements
- np complete
- distance function
- euclidean distance
- hurst exponent
- databases
- high computational complexity
- distance transform
- low complexity
- computational efficiency
- worst case
- computational cost
- storage requirements
- computational load
- special case
- distance measurement
- data structure