Login / Signup
Approximating the smallest 2-vertex connected spanning subgraph of a directed graph.
Loukas Georgiadis
Giuseppe F. Italiano
Aikaterini Karanasiou
Published in:
Theor. Comput. Sci. (2020)
Keyphrases
</>
directed graph
graph properties
random walk
edge weights
undirected graph
maximum flow
strongly connected
directed acyclic graph
graph mining
connected components
search space
web graph
graph structure
shortest path problem
np hard
graph data
graphical models