Exponential Speedup of Fixed-Parameter Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors

The Digital Librarian's Digital Library

DOCIS Documents in Computing and Information Science

Home >> Journals and Conference Proceedings >> Algorithmica

Exponential Speedup of Fixed-Parameter Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors

Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos

Journal Title: Algorithmica

Date: 2005

Volume: 41

Issue: 4

p. 245 - 267

For further information about this item go to:

http://www.springerlink.com/index/10.1007/s00453-004-1125-y

This data comes from DBLP

This page is maintained by Angela Cornwell and Thomas Krichel.
It was last updated on 2006-04-12