Parameterized and Exact Computation [electronic resource] : 7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings /

Contributor(s):

Material type: Text

TextSeries: Theoretical Computer Science and General Issues ; 7535Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2012Edition: 1st ed. 2012Description: X, 275 p. 14 illus. online resourceContent type:

text

Media type:

computer

Carrier type:

online resource

ISBN:

9783642332937

Subject(s):

Additional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification:

518.1 23

LOC classification:

QA76.9.A43

Online resources:

Click here to access online

In: Springer Nature eBookSummary: This book constitutes the refereed proceedings of the 7th International Symposium on Parameterized and Exact Computation, IPEC 2012, in Ljubljana, Slovenia, in September 2012. The 21 revised full papers presented together with 2 keynote talks were carefully reviewed and selected from 37 submissions. The topics addressed cover research in all aspects of parameterized/exact algorithms and complexity including but are not limited to new techniques for the design and analysis of parameterized and exact algorithms; fixed-parameter tractability results; parameterized complexity theory; relationship between parameterized complexity and traditional complexity classifications; applications of parameterized and exact computation; and implementation issues of parameterized and exact algorithms.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

No physical items for this record

This book constitutes the refereed proceedings of the 7th International Symposium on Parameterized and Exact Computation, IPEC 2012, in Ljubljana, Slovenia, in September 2012. The 21 revised full papers presented together with 2 keynote talks were carefully reviewed and selected from 37 submissions. The topics addressed cover research in all aspects of parameterized/exact algorithms and complexity including but are not limited to new techniques for the design and analysis of parameterized and exact algorithms; fixed-parameter tractability results; parameterized complexity theory; relationship between parameterized complexity and traditional complexity classifications; applications of parameterized and exact computation; and implementation issues of parameterized and exact algorithms.

There are no comments on this title.

to post a comment.