On the computational complexity of upper fractional domination

Authors:
G. A. Cheston;G. Fricke;S. T. Hedetniemi;D. P. Jacobs
Affiliations:
-;-;-;-
Venue:
Discrete Applied Mathematics
Year:
1990

Citing 0
Cited 2

On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem

TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
On the computational complexity of upper total domination

Discrete Applied Mathematics - Discrete mathematics and theoretical computer science (DMTCS)

Quantified Score

Hi-index	0.04

Visualization

Abstract