If you have suggestions, corrections, or comments, please get in touch (2) Nicos Christofides, An algorithm for the chromatic number of a graph, Computer J., 14(1):38-39, February 1971. Traub ed., page 441, Academic Press, New York, NY, 1976. on New Directions and Recent Results in Algorithms and Complexity, J. (1) Nicos Christofides, Worst-case analysis of a new heuristic for the travelling salesman problem, Report 388, Graduate School of Industrial Administration, CMU, 1976.Īlso CMU Tech. Minimum spanning tree, perfect matching, multigraph, Euler cycle. (2) An algorithm to find the chromatic number of a graph.Īggregate child (. Step 5: Turn the Euler cycle into a Hamiltonian cycle by skipping vertices already seen. Step 3: combine the edges of M and T to make a multigraph G. Step 2: find a perfect matching M among vertices with odd degree. (1) A heuristic algorithm to find a near-optimal solution to the traveling salesman problem. Christofides algorithm Christofides algorithm
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |