arc-disjoint paths

arc-disjoint paths

[‚ärk′dis‚jȯint pathz]
(mathematics)
In a graph, two paths with common end points that have no arcs in common.