Combinatorial Algorithms

Combinatorial Algorithms

by W. F. Symth, Subramanian Arumugam

Browse books you can read free on Readfeed

No club is reading this yet — be the first to start one

Start a club free
About
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.

Discuss Combinatorial Algorithms with other readers

Join or start a book club for Combinatorial Algorithms on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.

Frequently asked questions

How do I join a book club for Combinatorial Algorithms?

Sign up free on Readfeed, then browse public clubs or start your own club with Combinatorial Algorithms as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss Combinatorial Algorithms with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Combinatorial Algorithms with readers worldwide — whether your club is virtual, in-person, or hybrid.

Is Readfeed free?

Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.