Login / Signup
Finding maximal k-edge-connected subgraphs from a large graph.
Rui Zhou
Chengfei Liu
Jeffrey Xu Yu
Weifa Liang
Baichen Chen
Jianxin Li
Published in:
EDBT (2012)
Keyphrases
</>
connected subgraphs
directed acyclic graph
weighted graph
undirected graph
biological networks
connected components
strongly connected
random walk
data analysis
graph theory
databases
directed graph