LectureF 18_MATH 367 利物浦大学数学课件.pdfVIP

MATH 367: Networks in Theory and Practice Lecture 18 18. Planar graphs. Applications Transport networks and (classical) Traveling Salesman Problems deal with “geo- graphical” graphs where the vertices lay in the plane and the edges’ length represents some approximated physical distances among them. Here, we can expect that in such a graph the “triangle inequality” cij ≤ cik + ckj , for any t