Electronic Proceedings of the Twenty-sixth Annual International Conference on Technology in Collegiate Mathematics

San Antonio, Texas, March 20-23, 2014

Paper S086

This is an electronic reprint, reproduced by permission of Pearson Education Inc. Originally appeared in the Proceedings of the Twenty-sixth Annual International Conference on Technology in Collegiate Mathematics, Copyright (C) 2015 by Pearson Education, Inc.


Exploring Algorithms for Effective Applications of the Graph Theory

Vladimir V. Riabov


Rivier University
420 S. Main Street
Nashua, NH 03060-5086


list of all papers by this author


Click to access this paper: paper.pdf

ABSTRACT

Mathematical models and computing tools are explored for applications of the graph theory in informatics, networking technologies, complexity code analyses, and dynamics of biological and social systems. Various concepts are examined to evaluate route, covering and decomposition problems (minimum spanning tree, shortest path, travelling salesman problem, maximum cliques, and edge coloring).

Keyword(s): discrete mathematics, applications