Login / Signup

Maximal k-Edge-Connected Subgraphs in Weighted Graphs via Local Random Contraction.

Chaitanya NalamThatchaphol Saranurak
Published in: CoRR (2023)
Keyphrases
  • weighted graph
  • connected subgraphs
  • shortest path
  • graph structure
  • edge weights
  • biological networks
  • data objects
  • regularization framework
  • data analysis
  • directed acyclic graph
  • databases