Login / Signup

A Linear-Time Algorithm for Finding Locally Connected Spanning Trees on Circular-Arc Graphs.

Ching-Chi LinGen-Huey ChenGerard J. Chang
Published in: Algorithmica (2013)
Keyphrases
  • spanning tree
  • edge disjoint
  • circular arcs
  • minimum spanning tree
  • minimum spanning trees
  • minimum cost
  • undirected graph
  • weighted graph
  • straight line
  • edge weights
  • upper bound
  • line segments
  • approximation algorithms