Ignat I. Kolesnichenko

Learn More
General rights This document is made available in accordance with publisher policies. Please cite only the published version using the reference above. Full terms of use are available: Explore Bristol Research is a digital archive and the intention is that deposited content should not be removed. However, if you believe that this version of the work(More)
Consider an undirected graph G = (V G, EG) and a set of six terminals T = {s1, s2, s3, t1, t2, t3} ⊆ V G. The goal is to find a collection P of three edge-disjoint paths P1, P2, and P3, where Pi connects nodes si and ti (i = 1, 2, 3). Results obtained by Robertson and Seymour by graph minor techniques imply a polynomial time solvability of this problem. The(More)
  • 1