Sparse Subgraphs for 2-Connectivity in Directed Graphs.
Loukas GeorgiadisGiuseppe F. ItalianoAikaterini KaranasiouCharis PapadopoulosNikos ParotsidisPublished in: SEA (2016)
Keyphrases
- directed graph
- graph properties
- strongly connected
- graph structures
- random walk
- directed acyclic graph
- undirected graph
- high dimensional
- sparse data
- maximum flow
- connected components
- topological information
- data structure
- disjoint paths
- sparse representation
- connected subgraphs
- sparse matrix
- compressive sensing
- web graph
- graph databases
- markov chain
- upper bound