Some APX-completeness results for cubic graphs.

Paola Alimonti Viggo Kann

Published in: Theor. Comput. Sci. (2000)

Keyphrases

graph matching
graph representation
graph theoretic
directed graph
approximation algorithms
learning algorithm
structured objects
series parallel
graph structure
graph partitioning
lower bound
pattern recognition
graph data
subgraph isomorphism
objective function
neural network
graph isomorphism