• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Finding maximal k-edge-connected subgraphs from a large graph.

Rui ZhouChengfei LiuJeffrey Xu YuWeifa LiangBaichen ChenJianxin 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