The $k$-in-a-tree problem for graphs of girth at least~$k$.
Wei LiuNicolas TrotignonPublished in: CoRR (2013)
Keyphrases
- spanning tree
- tree structured data
- graph structure
- maximal cliques
- minimum spanning tree
- b tree
- tree structure
- binary tree
- minimum spanning trees
- graph theoretic
- graph matching
- graph theory
- index structure
- graph representation
- graph mining
- tree search
- directed graph
- r tree
- subgraph isomorphism
- tree models
- labeled trees