A Necessary and Sufficient Condition for a Bipartite Distance-Hereditary Graph to Be Hamiltonian.
Masahide TakasugaTomio HirataPublished in: TJJCCGG (2012)
Keyphrases
- sufficient conditions
- bipartite graph
- graph model
- graph partitioning
- edge weights
- undirected graph
- weighted graph
- vertex set
- graph structure
- exponential stability
- euclidean distance
- distance measure
- asymptotic stability
- directed graph
- linear systems
- linear complementarity problem
- uniform convergence
- lyapunov function
- efficiently computable
- real valued
- distance function
- distance metric
- markov random field
- upper bound
- support vector machine
- mobile robot