Paper by Erik D. Demaine
- 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.
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 , and Fellows and Langston 
toward obtaining fixed-parameter algorithms for a general class of parameters.
- This paper is also available from ScienceDirect.
- The paper is 4 pages.
- 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
Last updated September 25, 2017 by