Paper by Erik D. Demaine

Reference:
Erik D. Demaine and MohammadTaghi Hajiaghayi, “Quickly Deciding Minor-Closed Parameters in General Graphs”, European Journal of Combinatorics, volume 28, number 1, January 2007, pages 311–314.

Abstract:
We construct algorithms for deciding essentially any minor-closed parameter, with explicit time bounds. This result strengthens previous results by Robertson and Seymour [1,2], Frick and Grohe [3], and Fellows and Langston [4] toward obtaining fixed-parameter algorithms for a general class of parameters.

Comments:
This paper is also available from ScienceDirect.

Length:
The paper is 4 pages.

Availability:
The paper is available in PostScript (115k), gzipped PostScript (46k), and PDF (72k).
See information on file formats.
[Google Scholar search]


See also other papers by Erik Demaine.
These pages are generated automagically from a BibTeX file.
Last updated July 21, 2017 by Erik Demaine.