Graph-Theoretic Concepts in Computer Science
Subtitle: 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers (Lecture Notes in Computer Science)
Edition: 1 edition
Publisher: Springer
Published: January 12, 2004
Language: eng
Format: Paperback
Number of pages: 386
ISBN-13: 9783540204527
Subjects: Computer modelling & simulation; Mathematical theory of computation; Graph theory; Computers - General Information; Computers; Computer Books: General; Machine Theory; Discrete Mathematics; Computers / Computer Science; Computer Science; Congresses; Fundamentele informatica.; gtt
First sentence: The collection of methods for classifying problems as fixed-parameter tractable, for designing FPT algorithms, for designing better FPT algorithms and transfer-ing these results to practical implementations, and for describing FPT problem transformations to prove lower bound and intractability results, has developed with surprising vigor  yet it still seems we are far from having the "basic vocabulary" of effective FPT algorithm design techniques worked out.