Algorithmic Graph Theory and Sage

This is an introductory book on algorithmic graph theory. Theory and algorithms are illustrated using the Sage open source mathematics software.

**Tag(s):**
Graph Theory

**Publication date**: 10 May 2013

**ISBN-10**:
n/a

**ISBN-13**:
n/a

**Paperback**:
304 pages

**Views**: 7,451

Algorithmic Graph Theory and Sage

This is an introductory book on algorithmic graph theory. Theory and algorithms are illustrated using the Sage open source mathematics software.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled "GNU Free Documentation License".

Click**here** to read the full license.

Click

From the Introduction:

David Joyner, Minh Van Nguyen, and David Phillips wrote:A GNU-FDL book on algorithmic graph theory by David Joyner, Minh Van Nguyen, and David Phillips. This is an introductory book on algorithmic graph theory. Theory and algorithms are illustrated using the Sage open source mathematics software. To get an overview of the book, you can view the table of contents as shown below or download the complete book. This book is more commonly known as the "DaMNeD" book if you notice how our names are used to abbreviate the book. So feel free to call it the DaMNeD book :-)

Supplementary materials for the book can be found at https://bitbucket.org/mvngu/graphbook-supplement.

Tweet

About The Author(s)

W. David Joyner is a professor in the Department of Mathematics at The United States Naval Academy. He received his Ph.D. in Mathematics at the University of Maryland in May 1983. His research areas are error-correcting codes, representation theory and applications, and applications of number theory/group theory to communication theory and cryptography.

David Phillips is an associate professor in the math department at the United States Naval Academy. He is interested in the design and analysis of algorithms, conic optimization, combinatorial optimization and applications of operations research (especially practical applications of techniques from approximation algorithms).

Book Categories

Computer Science
Introduction to Computer Science
Introduction to Computer Programming
Algorithms and Data Structures
Artificial Intelligence
Computer Vision
Machine Learning
Neural Networks
Game Development and Multimedia
Data Communication and Networks
Coding Theory
Computer Security
Information Security
Cryptography
Information Theory
Computer Organization and Architecture
Operating Systems
Image Processing
Parallel Computing
Concurrent Programming
Relational Database
Document-oriented Database
Data Mining
Big Data
Data Science
Digital Libraries
Compiler Design and Construction
Functional Programming
Logic Programming
Object Oriented Programming
Formal Methods
Software Engineering
Agile Software Development
Information Systems
Geographic Information System (GIS)

Mathematics
Mathematics
Algebra
Abstract Algebra
Linear Algebra
Number Theory
Numerical Methods
Precalculus
Calculus
Differential Equations
Category Theory
Proofs
Discrete Mathematics
Theory of Computation
Graph Theory
Real Analysis
Complex Analysis
Probability
Statistics
Game Theory
Queueing Theory
Operations Research
Computer Aided Mathematics

Supporting Fields
Web Design and Development
Mobile App Design and Development
System Administration
Cloud Computing
Electric Circuits
Embedded System
Signal Processing
Integration and Automation
Network Science
Project Management

Operating System
Programming/Scripting
Ada
Assembly
C / C++
Common Lisp
Forth
Java
JavaScript
Lua
Microsoft .NET
Rexx
Perl
PHP
Python
R
Rebol
Ruby
Scheme
Tcl/Tk

Miscellaneous
Sponsors