Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs.
Ahmed AinoucheNicos ChristofidesPublished in: J. Comb. Theory, Ser. B (1981)
Keyphrases
- undirected graph
- directed acyclic graph
- directed graph
- connected components
- approximation algorithms
- disjoint paths
- positive integer
- spanning tree
- minimum cost
- complex networks
- markov models
- graph structure
- vertex set
- random variables
- undirected graphical models
- strongly connected
- graph structures
- social networks
- multicommodity flow
- random walk
- multi dimensional
- probabilistic model
- relational databases
- pairwise
- lower bound
- image segmentation