Sign in

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

Kazuyuki MiuraDaishiro TakahashiShin-Ichi NakanoTakao Nishizeki
Published in: WG (1998)
Keyphrases
  • spanning tree
  • planar graphs
  • minimum weight
  • undirected graph
  • minimum spanning tree
  • edge disjoint
  • minimum cost
  • weighted graph
  • connected components
  • edge weights
  • total length
  • probabilistic model