On the complexity of the approximation of nonplanarity parameters for cubic graphs.
Luérbio FariaCelina M. H. de FigueiredoCandido Ferreira Xavier de Mendonça NetoPublished in: Electron. Notes Discret. Math. (2001)
Keyphrases
- approximation error
- parameter estimation
- parameter values
- polynomial time complexity
- expectation maximization
- closed form
- data sets
- approximation algorithms
- update equations
- approximation ratio
- queueing networks
- graph representation
- graph structure
- parameter settings
- directed graph
- sensitivity analysis
- np complete
- maximum likelihood
- least squares
- optimal solution