Amazon cover image
Image from Amazon.com
Image from Google Jackets

Combinatorial Algorithms [electronic resource] : 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers / edited by Costas S. Iliopoulos, William F. Smyth.

Contributor(s): Material type: TextTextSeries: Lecture Notes in Computer Science ; 6460Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 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 titleDDC classification:
  • 004.0151 23
LOC classification:
  • QA76.9.M35 
Online resources: In: Springer eBooksSummary: 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.
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Home library Call number Materials specified URL Status Date due Barcode
IMSc Library Link to resource Available EBK9522

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.
The Institute of Mathematical Sciences, Chennai, India