Forcing Finite Minors in Sparse Infinite Graphs by Large-Degree Assumptions.
Reinhard DiestelPublished in: Electron. J. Comb. (2015)
Keyphrases
- finite sets
- random graphs
- gaussian graphical models
- sparse data
- high dimensional
- real numbers
- graph theoretic
- finite dimensional
- sparse representation
- dictionary learning
- compressive sensing
- graph mining
- finite number
- bipartite graph
- graph clustering
- complex structures
- compressed sensing
- graph construction
- finite automata
- series parallel
- graph theory