An efficient condition for a graph to be Hamiltonian.
Shengjia LiRuijuan LiJinfeng FengPublished in: Discret. Appl. Math. (2007)
Keyphrases
- sufficient conditions
- graph theoretic
- directed graph
- graph representation
- graph theory
- graph structure
- weighted graph
- data mining
- random walk
- directed acyclic graph
- graph mining
- stable set
- graph structures
- graph construction
- bi directional
- graph model
- graph matching
- structured data
- computationally efficient
- probabilistic model
- search algorithm
- image segmentation