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: Discret. Appl. Math. (2004)
Keyphrases
- approximation error
- maximum likelihood
- neural network
- computational complexity
- expectation maximization
- polynomial time complexity
- parameter values
- probability density function
- parameter estimation
- input data
- error bounds
- decision problems
- graph matching
- space complexity
- graph partitioning
- graph representation
- data sets