On the computational complexity of upper fractional domination.
Grant A. ChestonGerd FrickeStephen T. HedetniemiDavid Pokrass JacobsPublished in: Discret. Appl. Math. (1990)
Keyphrases
- computational complexity
- np complete
- high computational complexity
- computational efficiency
- real time
- fractional order
- computational load
- memory requirements
- low complexity
- computational cost
- bit rate
- computationally efficient
- linear computational complexity
- storage requirements
- decision problems
- np hard
- special case
- cooperative
- dynamical systems
- rate distortion
- multimedia
- machine learning
- data sets