Using A Heuristic Algorith m to Help Analyze Graph Problem s LieJune Shia u Department of Mathematics and Compute r Scienc e University of Houston - Clear Lak e Houston, TX 7705 8 Introductio n The study of graphs in most book s implies that graphs can be investigate d by simple analyti c and analyzed begin to techniques . When students even moderately complicate d explore real-worl d problems that arise in such as the travelin g applications, system, an d transportation salesman, network problems, they soon realize thi s is not true . Very often, usefu l information about a graph is concealed an d can be found visually only after th e vertices are rearranged . My main point i n this paper is that computer graphics , combined with a simple heuristi c algorithm, can provide a powerful new too l for exploring graphs . This new tool i s easy to use, and also gives insight no t readily attainable by traditional analyti c techniques . Furthermore, this tool ca n provide geometric views which motivat e analytic arguments . A Heuristic Algorith m A graph can be represented as a n adjacency
/lp/association-for-computing-machinery/using-a-heuristic-algorithm-to-help-analyze-graph-problems-sRy5VrRdOV