Login / Signup

Polynomial Algorithms for Some Hard Problems of Finding Connected Spanning Subgraphs of Extreme Total Edge Weight.

Alexey BaburinEdward Gimadi
Published in: OR (2006)
Keyphrases
  • hard problems
  • data structure
  • edge weights
  • computational complexity
  • phase transition
  • bipartite graph
  • evolutionary algorithm
  • particle swarm optimization
  • spanning tree