Treelike decompositions for transductions of sparse graphs.
Jan DreierJakub GajarskýSandra KieferMichal PilipczukSzymon TorunczykPublished in: CoRR (2022)
Keyphrases
- finite state
- gaussian graphical models
- graph matching
- high dimensional
- directed acyclic
- neural network
- sparse representation
- finite automata
- graph theory
- sparse data
- pattern recognition
- random graphs
- compressive sensing
- directed graph
- markov chain
- graph databases
- graph representation
- graph theoretic
- graph model
- weighted graph
- graph clustering
- sparse coding
- compressed sensing
- series parallel
- singular value decomposition