Approximating the Longest Cycle Problem in Sparse Graphs.
Tomás FederRajeev MotwaniCarlos S. SubiPublished in: SIAM J. Comput. (2002)
Keyphrases
- gaussian graphical models
- directed acyclic
- sparse data
- high dimensional
- graph matching
- graph theoretic
- sparse matrix
- graph structures
- compressed sensing
- graphical models
- directed graph
- graph databases
- graph structure
- graph data
- graph mining
- learning algorithm
- graph theory
- bipartite graph
- pattern recognition
- sparse representation
- graph clustering
- random graphs
- upper bound
- pairwise
- lower bound
- series parallel
- bayesian networks