A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix
Mehrnoush MalekesmaeiliCédric ChauveTamon StephenPublished in: CoRR (2011)
Keyphrases
- upper bound
- lower bound
- worst case
- adjacency matrix
- singular value decomposition
- low rank and sparse
- generalization error bounds
- graph structure
- graph model
- similarity matrix
- structured data
- random walk
- graph theory
- graph representation
- directed graph
- eigenvalues and eigenvectors
- weighted graph
- transition matrix
- homology generators
- matrix representation
- constant factor
- directed acyclic graph
- graph clustering
- graph matching
- small world
- graph based algorithm
- weight matrix
- error bounds
- connected components
- np hard
- pairwise