## DaMN book now on Softpedia

My book-in-progress Algorithmic Graph Theory, co-authored with David Joyner and Nathann Cohen, is now listed on Softpedia. These days I rather refer to the book as the DaMN book. The name is taken from the first letter of the first name of each author.

## Version 0.7 of book “Algorithmic Graph Theory” released

Here is version 0.7 of the book Algorithmic Graph Theory. The relevant download options are:

Version 0.7 fleshes out the chapter “Random Graphs”. Here is the content of the chapter in brief:

- Network statistics
- Binomial random graph model
- Erdos-Renyi model
- Small-world networks
- Scale-free networks

## Version 0.6 of book “Algorithmic Graph Theory” released

Happy new year, folks! As a new year’s gift to you, here is version 0.6 of the book Algorithmic Graph Theory. The relevant download options are:

Version 0.6 adds the new chapter “Tree Data Structures” that discusses priority queues and various efficient implementations of priority queues, including binary heaps and binomial heaps. Here is the content of the new chapter in brief:

- Priority queues
- Binary heaps
- Binomial heaps
- Binary search trees

## Version 0.5 of the book “Algorithmic Graph Theory”

I’m happy as a clam to announce version 0.5 of the book Algorithmic Graph Theory for your reading pleasure.

The main focus of this release is to flesh out the chapter on trees and forests. Along the way, numerous problems/exercises are added to the introductory chapter “Introduction to Graph Theory” and the chapter “Graph Algorithms”. Needless to say, there are also the multitude of typo fixes throughout the book. We, the authors of the book, gratefully acknowledge contributions from the following people while preparing this release:

- Caroline Melles
- Pravin Paratey

See the section “Acknowledgments” in the book for full details on their contributions. Here is an outline of topics covered in the newly fleshed out chapter “Trees and Forests”:

- Definitions and examples relating to trees and forests.
- Various basic characterizations of trees.
- Techniques for constructing minimum spanning trees: a randomized spanning tree construction algorithm and the usual suspects including Kruskal’s algorithm, Prim’s algorithm, and Boruvka’s algorithm.
- Binary trees and an algorithm to construct a random binary tree. Application topics include coding theory, Gray code, and Huffman code.
- The usual suspects of tree traversal algorithms: level-order, pre-order, post-order, and in-order.

## Version 0.4 of book “Sage for High School” released

I’m happy to announce the release of version 0.4 of the book Sage for High School. My primary concern in this version was to flesh out the chapter “Vectors and Matrices”. The PDF and source tarball are available for download. The chapter outline is as follows:

- Scalars and vectors
- Add, subtract, and multiply vectors
- Three-dimensional vectors
- The dot product
- Parallel and perpendicular vectors
- Matrices and determinants
- The cross product

Version 0.4 adds another section to the chapter “Number Theory”, called “Kid RSA”. This additional section explains a simplified version of the RSA cryptosystem, using number theoretic concepts introduced in the chapter “Number Theory”. The simplified cryptosystem is called “Kid RSA”, developed by Neal Koblitz. You can find Kid RSA in his book:

- N. Koblitz.
*Algebraic Aspects of Cryptography.*Springer, 1998.

## Version 0.3 of book “Sage for High School” released

I have released version 0.3 of the book Sage for High School. Both the PDF and source tarball are available for download. This version fleshes out the chapter “Number Theory”, with materials for the following sections:

- Integers
- Prime numbers
- Divisibility
- Greatest common divisors: relatively prime integers
- Least common multiples: Simplifying fractions
- Clock arithmetic

## Version 0.2 of book “Sage for High School” released

I have completed chapter 1 “Algebraic Simplification” of the book Sage for High School. All changes have been pushed to Google Code. The latest stable release is now at version 0.2. Both the PDF version and the source tarball are available for download.

This book began life when Phillip M. Feldman asked on sage-edu about a Sage tutorial for high school students. At the time, there was a dearth of tutorials for high school students to learn how to use Sage to enhance their study of mathematics. Within a day, I posted an outline of a tutorial for high school students.

The tutorial itself is open source. I invite people to contribute to fleshing out the tutorial.