1st Edition

Simulation for Applied Graph Theory Using Visual C++

    354 Pages 127 B/W Illustrations
    by Chapman & Hall

    354 Pages 127 B/W Illustrations
    by Chapman & Hall

    The tool for visualization is Microsoft Visual C++. This popular software has the standard C++ combined with the Microsoft Foundation Classes (MFC) libraries for Windows visualization. This book explains how to create a graph interactively, solve problems in graph theory with minimum number of C++ codes, and provide friendly interfaces that makes learning the topics an interesting one. Each topic in the book comes with working Visual C++ codes which can easily be adapted as solutions to various problems in science and engineering.

    Graph Theory. Introductory Concepts. Spectral Graph Theory. Visualization with MFC. Windows Programming. Microsoft Foundation Classes. Writing the Simplest Windows Program. Windows Resources for Text and Graphics. Event and Event Handler. Windows Control Resources. Displaying a Graph. Hexagonal Network. Graph Coloring. Background. Node Coloring Problem. Greedy Algorithm. Channel Assignment on Wireless Mesh Networks. Computing the Shortest Path. Problem Description. Single-Source Shortest Path Problem. Floyd-Warshall’s Method for the All-Pairs Shortest Paths. Mini-GPS. Multicolumn Interconnection Network. Computing the Minimum Spanning Tree. Problem Description. Algorithms for Computing Minimum Spanning Tree. Case Study of the Pavement Construction Problem. Case Study of a Broadcasting Problem. Computing the Maximum Clique. Problem Description. Computing the Multiple Cliques of a Graph. Application of Clustering for Social Networking. Triangulation Application. Convex Hull. Algorithms for Computing the Convex Hull. Delaunay Triangulation. Scheduling Application. Scheduling Problem. Dynamic Job Scheduling. Task Scheduling on Multiprocessor Systems. Target Detection Application. Target Detection Problem. Target Detection Using Radar and Antennas. Wireless Sensor Networks. Network Routing Application. Network Routing Problem. Routing in a Reconfigurable Mesh Network. Single-Row Routing.

    Biography

    Shaharuddin Salleh is currently a professor of computational mathematics at the Center for Industrial and Applied Mathematics, and the Department of Mathematical Sciences, Universiti Teknologi Malaysia. He obtained his PhD at the same university, his MS at Portland State University, and BS at California State University Chico. Prof. Salleh is the author of six books, including two for Wiley-Interscience, Hoboken, New Jersey, in 2005 and 2008; and one for Kluwer Academic Publishers (now Springer) in 1999. His research interests are numerical computing, parallel computing, applied graph theory, and wireless sensor networks. Prof. Salleh has published over 150 technical papers in journals and conferences.

    Zuraida Abal Abas is currently a senior lecturer at the Department of Industrial Computing, Faculty of Information and Communication Technology, Universiti Teknikal Malaysia Melaka. She obtained her PhD in mathematics at Universiti Teknologi Malaysia; her MSc in operational research at London School of Economics, United Kingdom; and her BSc in industrial mathematics at Universiti Teknologi Malaysia. Her research interests are operational research, applied graph theory, modeling, and simulation.