Algorithmic Implications of the Graph Minor Theorem∗ Daniel Bienstock Dept. of Civil Engineering Columbia University - Intersection theory - Document - PDFSEARCH.IO

First Page	Meta Content
	Algorithmic Implications of the Graph Minor Theorem∗ Daniel Bienstock Dept. of Civil Engineering Columbia University Add to Reading List Document Date: 2003-10-15 21:13:20 Open Document File Size: 253,18 KB Share Result on Facebook City New York / / Facility Civil Engineering Columbia University / Computer Science University of Tennessee Knoxville / / IndustryTerm polynomial-time algorithm / desired polynomial-time algorithm / direct algorithm / important applications / / Organization Columbia University / S. Let / Computer Science University of Tennessee Knoxville / / Person Michael A. Langston / Paul Seymour / Neil Robertson / / ProvinceOrState Tennessee / New York / / Technology resulting algorithm / testing algorithm / desired polynomial-time algorithm / polynomial-time algorithm / / SocialTag Robertson–Seymour theorem Path decomposition Tree decomposition Planar graph Intersection graph Clique Graph property Chordal graph Graph structure theorem Graph theory

Algorithmic Implications of the Graph Minor Theorem∗ Daniel Bienstock Dept. of Civil Engineering Columbia UniversityAdd to Reading List