Sparse Graphs Are Near-Bipartite.
Daniel W. CranstonMatthew P. YanceyPublished in: SIAM J. Discret. Math. (2020)
Keyphrases
- graph model
- bipartite graph
- undirected graph
- graph partitioning
- gaussian graphical models
- graph representation
- high dimensional
- graph matching
- real valued
- data sets
- weighted graph
- directed graph
- graph databases
- sparse data
- directed acyclic
- sparse representation
- compressive sensing
- graph theory
- spanning tree
- kernel methods
- complex structures
- linear combination
- small world
- compressed sensing