Login / Signup

Minimum Node Disjoint Path Covering for Circular-Arc Graphs.

Maurizio A. BonuccelliDaniel P. Bovet
Published in: Inf. Process. Lett. (1979)
Keyphrases
  • circular arcs
  • multiple paths
  • node disjoint
  • multipath routing
  • network routing
  • multipath
  • straight line
  • ad hoc networks
  • line segments
  • shortest path
  • image segmentation
  • endpoints
  • random graphs
  • wireless mesh networks