Testing Eulerianity and connectivity in directed sparse graphs.
Yaron OrensteinDana RonPublished in: Theor. Comput. Sci. (2011)
Keyphrases
- sparse data
- high dimensional
- neural network
- graph theoretic
- directed graph
- sparse representation
- topological information
- gaussian graphical models
- graph matching
- data sets
- compressive sensing
- series parallel
- graph connectivity
- connected components
- weighted graph
- graph partitioning
- graph kernels
- strongly connected
- brain connectivity