Efficient recognition algorithms for boundary and linear eNCE graph languages.

Published in: Acta Informatica (2001)

Keyphrases

computationally expensive
computationally efficient
graph theory
data structure
pattern recognition
optimization problems
recognition rate
linear space
significant improvement
bipartite graph
learning algorithm
feature extraction
computational complexity
worst case
connected components
edge weights