Combinatorial Algorithms [electronic resource] : 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers /

Contributor(s):

Material type: Text

TextSeries: Theoretical Computer Science and General Issues ; 6460Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2011Edition: 1st ed. 2011Description: XI, 418 p. online resourceContent type:

text

Media type:

computer

Carrier type:

online resource

ISBN:

9783642192227

Subject(s):

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

004.0151 23

LOC classification:

QA76.9.M35
QA297.4

Online resources:

Click here to access online

In: Springer Nature eBookSummary: This book constitutes the thoroughly referred post-proceedings of the 21st International Workshop on Combinatorial Algorithms, IWOCA 2010, held in London, UK, in July 2010. The 31 revised full papers presented together with extended abstracts of 8 poster presentations were carefully reviewed and selected from a total of 85 submissions. A broad variety of combinatorial graph algorithms for the computations of various graph features are presented; also algorithms for network compuation, approximation, computational geometry, games, and search are presented and complexity aspects of such algorithms are discussed.

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 thoroughly referred post-proceedings of the 21st International Workshop on Combinatorial Algorithms, IWOCA 2010, held in London, UK, in July 2010. The 31 revised full papers presented together with extended abstracts of 8 poster presentations were carefully reviewed and selected from a total of 85 submissions. A broad variety of combinatorial graph algorithms for the computations of various graph features are presented; also algorithms for network compuation, approximation, computational geometry, games, and search are presented and complexity aspects of such algorithms are discussed.

There are no comments on this title.

to post a comment.