Weak oddness as an approximation of oddness and resistance in cubic graphs.
Robert Lukot'kaJán MazákPublished in: Discret. Appl. Math. (2018)
Keyphrases
- structured objects
- subgraph isomorphism
- graph representation
- database
- graph matching
- graph databases
- labeled graphs
- graph kernels
- relative error
- weighted graph
- closed form
- b spline
- approximation algorithms
- error bounds
- efficient computation
- graph theoretic
- random graphs
- object recognition
- approximation methods
- pattern recognition
- approximation schemes
- neural network
- data sets