A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix.
Mehrnoush MalekesmaeiliCédric ChauveTamon StephenPublished in: Inf. Process. Lett. (2012)
Keyphrases
- lower bound
- upper bound
- worst case
- adjacency matrix
- graph representation
- similarity matrix
- directed graph
- random walk
- total length
- weight matrix
- graph based algorithm
- weighted graph
- transition matrix
- constant factor
- eigenvalues and eigenvectors
- linear algebra
- path length
- generalization error bounds
- spanning tree
- graph model
- directed acyclic graph
- graph structure
- singular value decomposition
- graph mining
- graph kernels
- positive definite
- approximation algorithms
- connected components
- structured data
- pairwise
- bayesian networks