Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs.
Loukas GeorgiadisGiuseppe F. ItalianoCharis PapadopoulosNikos ParotsidisPublished in: ESA (2015)
Keyphrases
- directed graph
- strongly connected
- disjoint paths
- edge weights
- undirected graph
- graph properties
- random walk
- connected components
- directed acyclic graph
- np hard
- maximum flow
- graph structures
- graph mining
- approximation algorithms
- edge information
- edge detection
- special case
- reinforcement learning
- graph structure
- machine learning
- markov chain
- upper bound
- query language
- search space