Login / Signup

Approximating Node-Weighted k-MST on Planar Graphs.

Jaroslaw ByrkaMateusz LewandowskiJoachim Spoerhase
Published in: Theory Comput. Syst. (2020)
Keyphrases
  • planar graphs
  • edge weights
  • weighted graph
  • undirected graph
  • minimum weight
  • minimum spanning tree
  • bipartite graph
  • graph structure
  • spanning tree
  • directed graph
  • image segmentation
  • upper bound
  • approximate inference