Login / Signup

An algorithm for delta-wye reduction of almost-planar graphs.

Isidoro GitlerGustavo Sandoval-Angeles
Published in: Discret. Appl. Math. (2020)
Keyphrases
  • worst case
  • computational complexity
  • objective function
  • pairwise
  • np hard
  • optimal solution
  • special case
  • linear programming
  • expectation maximization
  • complex networks
  • spanning tree
  • planar graphs