Decomposing regular graphs with prescribed girth into paths of given length.
Fábio BotlerGuilherme Oliveira MotaM. T. I. OshiroYoshiko WakabayashiPublished in: Eur. J. Comb. (2017)
Keyphrases
- path length
- shortest path
- graph theoretic
- graph matching
- maximum number
- graph theory
- fixed length
- total length
- series parallel
- subgraph isomorphism
- graph databases
- graph mining
- data structure
- neural network
- bipartite graph
- directed graph
- pairwise
- pattern recognition
- search algorithm
- adjacency matrix
- information retrieval
- minimum length
- database