Login / Signup

A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs.

Sayaka NagaiShin-Ichi Nakano
Published in: WG (2000)
Keyphrases
  • spanning tree
  • planar graphs
  • minimum weight
  • undirected graph
  • edge disjoint
  • minimum spanning tree
  • minimum cost
  • weighted graph
  • approximate inference
  • optimization problems
  • traveling salesman problem