| Description |
1 online resource (354 pages) |
| Series |
A Chapman & Hall Book |
| Contents |
Cover; Half Title; Title Page; Copyright Page; Dedication; Contents; Preface; Authors; 1. Graph Theory; 1.1 Introductory Concepts; 1.1.1 Paths in a Graph; 1.1.2 Subgraph; 1.1.3 Tree; 1.2 Spectral Graph Theory; 2. Visualization with MFC; 2.1 Windows Programming; 2.2 Microsoft Foundation Classes; 2.2.1 Windows Interface Design; 2.2.2 Color Management; 2.2.3 Device Context; 2.3 Writing the Simplest Windows Program; 2.3.1 Initializing an Application with Windows; 2.3.2 Creating the Main Window; 2.3.3 Displaying a Text Message; 2.3.4 Code2A: Skeleton Program |
|
2.4 Windows Resources for Text and Graphics2.4.1 Setting Up the Device Context; 2.4.2 Formatted Text Output; 2.4.3 Setting the Pen Color; 2.4.4 Defining a Point in Windows; 2.4.5 Plotting a Point in Windows; 2.4.6 Drawing a Line; 2.4.7 Drawing a Polygon; 2.4.8 Drawing an Empty Rectangle; 2.4.9 Drawing a Solid-Filled Color Rectangle; 2.4.10 Drawing an Ellipse; 2.4.11 Drawing a Circle; 2.4.12 Clearing a Portion of Window; 2.4.13 Clearing the Whole Window; 2.4.14 Code2B: Graphics Drawing; 2.5 Event and Event Handler; 2.6 Windows Control Resources; 2.6.1 Edit Box; 2.6.2 Static Box |
|
2.6.3 Push Button2.6.4 List View Window; 2.7 Displaying a Graph; 2.7.1 Designing the Work Area; 2.7.2 Data Structure of a Graph; 2.7.3 Random Placement of Nodes; 2.7.4 Code2C: Displaying a Graph; 2.8 Hexagonal Network; 2.8.1 Code2D: Designing a Hexagonal Network; 3. Graph Coloring; 3.1 Background; 3.2 Node Coloring Problem; 3.2.1 Node Coloring and Eigenvalues; 3.2.2 Power Method for Finding the Most Dominant Eigenvalue; 3.2.3 Code3A: Power Method for Estimating the Chromatic Number; 3.3 Greedy Algorithm; 3.3.1 Code3B: Node Coloring Using a Greedy Algorithm |
|
3.4 Channel Assignment on Wireless Mesh Networks3.4.1 Problem Statement; 3.4.2 Code3C: Constrained Single-Channel Assignment; 4. Computing the Shortest Path; 4.1 Problem Description; 4.2 Single-Source Shortest Path Problem; 4.2.1 Dijkstra's Algorithm; 4.2.2 Code4A: Implementing Dijkstra's Algorithm; 4.3 Floyd-Warshall's Method for the All-Pairs Shortest Paths; 4.3.1 Code4B: Implementing Floyd-Warshall's Algorithm; 4.4 Mini-GPS; 4.4.1 Code4C: Implementing the Mini-GPS; 4.5 Multicolumn Interconnection Network; 4.5.1 Code4D: Multicolumn Interconnection Network |
|
5. Computing the Minimum Spanning Tree5.1 Problem Description; 5.2 Algorithms for Computing Minimum Spanning Tree; 5.2.1 Kruskal's Algorithm; 5.2.2 Prim's Algorithm; 5.2.3 Code5A: Kruskal's Algorithm; 5.3 Case Study of the Pavement Construction Problem; 5.3.1 Code5B: Pavement Construction; 5.4 Case Study of a Broadcasting Problem; 5.4.1 Code5C: Broadcasting Problem; 6. Computing the Maximum Clique; 6.1 Problem Description; 6.1.1 Greedy Algorithm for Finding the Maximum Clique; 6.1.2 Code6A: Implementing the Greedy Algorithm; 6.2 Computing the Multiple Cliques of a Graph |
| Notes |
6.2.1 Greedy Algorithm for Finding the Multicliques |
| Bibliography |
Includes bibliographical references and index |
| Notes |
Print version record |
| SUBJECT |
Microsoft Visual C++. http://id.loc.gov/authorities/names/n92107146
|
|
Microsoft Visual C++ fast (OCoLC)fst01380152 |
| Subject |
Graph theory -- Data processing.
|
|
Graph theory -- Data processing.
|
| Form |
Electronic book
|
| Author |
Abas, Zuraida Abal
|
| ISBN |
9781498721035 |
|
1498721036 |
|
1315370921 |
|
9781315370927 |
|
1315353776 |
|
9781315353777 |
|
