Decomposing graphs with girth at least five under degree constraints.

Published in: J. Graph Theory (2000)

Keyphrases

random graphs
constraint programming
series parallel
graph representation
directed graph
neural network
shortest path
structured data
constraint satisfaction
search space
pattern recognition
graph matching
constrained optimization
graph mining
undirected graph
case study
graph theoretic
database