Save 40% on select Business & Management books + FREE shipping or 50% on Physics eBooks!

Theoretical Computer Science and General Issues

Combinatorial Algorithms

23rd International Workshop, IWOCA 2012, Krishnankoil, India, July 19-21, 2012, Revised Selected Papers

Editors: Symth, W. F., Subramaniam, Arumugam (Eds.)

Free Preview
  • Fast-track conference proceedings
  • State-of-the-art research
  • Up-to-date results
see more benefits

Buy this book

eBook $64.99
price for USA in USD (gross)
  • ISBN 978-3-642-35926-2
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $83.00
price for USA in USD
  • ISBN 978-3-642-35925-5
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

This book constitutes the thoroughly referred post-workshop proceedings of the 23rd International Workshop on Combinatorial Algorithms, IWOCA 2012, held in Krishnankoil, Tamil Nadu, India, in July 2012. The 32 revised full papers presented were carefully reviewed and selected from a total of 88 submissions. The papers are organized in topical sections in algorithms and data Structures, applications (including Bioinformatics, Networking, etc.), combinatorics of words and strings, combinatorial optimization, combinatorial enumeration, decompositions and combinatorial designs, complexity theory (structural and computational), computational biology and graph theory and combinatorics submissions.

Table of contents (32 chapters)

Table of contents (32 chapters)
  • Bounds on Quasi-Completeness

    Pages 1-5

    Bhattacharyya, Malay (et al.)

  • Infinite Random Geometric Graphs from the Hexagonal Metric

    Pages 6-19

    Bonato, Anthony (et al.)

  • Saving on Phases: Parameterized Approximation for Total Vertex Cover

    Pages 20-31

    Fernau, Henning

  • On Graph Identification Problems and the Special Case of Identifying Vertices Using Paths

    Pages 32-45

    Foucaud, Florent (et al.)

  • Disjoint Set Forest Digraph Representation for an Efficient Dominator Tree Construction

    Pages 46-59

    Fraczak, Wojciech (et al.)

Buy this book

eBook $64.99
price for USA in USD (gross)
  • ISBN 978-3-642-35926-2
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $83.00
price for USA in USD
  • ISBN 978-3-642-35925-5
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Combinatorial Algorithms
Book Subtitle
23rd International Workshop, IWOCA 2012, Krishnankoil, India, July 19-21, 2012, Revised Selected Papers
Editors
  • W. F. Symth
  • Arumugam Subramaniam
Series Title
Theoretical Computer Science and General Issues
Series Volume
7643
Copyright
2012
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-642-35926-2
DOI
10.1007/978-3-642-35926-2
Softcover ISBN
978-3-642-35925-5
Edition Number
1
Number of Pages
XII, 303
Number of Illustrations
136 b/w illustrations
Topics