vertex-disjoint paths

vertex-disjoint paths

[¦vər‚teks ′dis‚jȯint ‚paths]
(mathematics)
In a graph, two paths with common end points that have no other points in common.
References in periodicals archive ?
We now link the vertices of [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] by means of several vertex-disjoint paths.
For instance, both the HAMILTONIAN CYCLE and VERTEX-DISJOINT PATHS problems admit polynomial kernels parameterized by vertex cover.
G is said to be t-vertex-connected if at least t vertex-disjoint paths connect every pair of its vertices.
We say (P, Q) is connected if there is a collection of vertex-disjoint paths joining [p.