On Induced Versions of Menger's Theorem on Sparse Graphs.
Peter GartlandTuukka KorhonenDaniel LokshtanovPublished in: CoRR (2023)
Keyphrases
- directed acyclic
- sparse data
- gaussian graphical models
- structured objects
- graph matching
- data sets
- directed graph
- sparse representation
- compressed sensing
- dictionary learning
- graph representation
- graph theoretic
- database
- neural network
- pattern recognition
- subgraph isomorphism
- von neumann
- random graphs
- compressive sensing
- feature space
- graph databases
- graph model
- weighted graph
- graph theory
- graphical models
- sparse coding
- random walk