graph minors

Article View: ut.theory

Article #329

#329

From: Stephen Cook
Date: Thu, 06 Apr 1989 20:36

4 lines
516 bytes

I have a paper by Robertson and Seymour outlining their algorithm for the
disjoint paths problem.  This will be  the subject of Roberson's talk
next Wed.  I'm happy to lend it out.
    Steve

Technical Details

Message-ID: <89Apr6.163622edt.38113@neat.ai.toronto.edu>

Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!neat.ai.toronto.edu!root

Show Full Headers

Complete Article Headers

Newsgroups: ut.theory
Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!neat.ai.toronto.edu!root
From: sacook@ai.toronto.edu (Stephen Cook)
Subject: graph minors
Message-ID: <89Apr6.163622edt.38113@neat.ai.toronto.edu>
Organization: Department of Computer Science, University of Toronto
Date: Thu, 6 Apr 89 16:36:13 EDT