Sign in

Ther Are Planar Graphs Almost as Good as the Complete Graphs and as Short as Minimum Spanning Trees.

Christos LevcopoulosAndrzej Lingas
Published in: Optimal Algorithms (1989)
Keyphrases
  • minimum spanning trees
  • planar graphs
  • max cut
  • spanning tree
  • minimum spanning tree
  • minimum weight
  • undirected graph
  • approximate inference
  • neighborhood graph