Pfadfamilien
Pfadfamilien, or path families in English, are a concept in graph theory. In a graph G = (V, E), a Pfadfamilie F is a collection of simple paths in G. Each path is a sequence of distinct vertices v1, v2, ..., vk with consecutive vertices joined by edges. In directed graphs, the paths respect edge directions and are called directed or s-t paths when endpoints are specified.
Path families are studied with various constraints. A vertex-disjoint path family is one in which the paths
Key problems related to Pfadfamilien include the disjoint paths problem, which asks whether there exist k pairwise
Applications of path families appear in network routing, VLSI circuit design, and routing problems where non-overlapping