Overview
- High quality selected papers
- Unique visibility
- State of the art research
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 6460)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Included in the following conference series:
Conference proceedings info: IWOCA 2010.
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (39 papers)
Other volumes
-
Combinatorial Algorithms
Keywords
- combinatorial enumeration
- computational complexity
- graph coloring
- graph labeling
- hypergraphs
- matrix computation
- network routing alorithms
- parameterized algorithms
- parameterized complexity
- problem complexity
- shortest path computation
- string matching
- tree matching
- algorithm analysis and problem complexity
- data structures
About this book
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.
Editors and Affiliations
Bibliographic Information
Book Title: Combinatorial Algorithms
Book Subtitle: 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers
Editors: Costas S. Iliopoulos, William F. Smyth
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-642-19222-7
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer Berlin Heidelberg 2011
Softcover ISBN: 978-3-642-19221-0Published: 16 March 2011
eBook ISBN: 978-3-642-19222-7Published: 14 March 2011
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XI, 418
Topics: Discrete Mathematics in Computer Science, Symbolic and Algebraic Manipulation, Algorithm Analysis and Problem Complexity, Data Structures, Algorithms, Coding and Information Theory