Title :
Multiple research problems based on graph and network analysis
Author_Institution :
Math. & Comput. Coll., North-Western Minorities Univ., Lanzhou, China
Abstract :
Dijkstra algorithm, under different constraints, starting from Zhengzhou, research visits to capital cities and municipalities in the country after he returned to the starting point of the optimal path of Zhengzhou. and use approximation algorithms to find approximate optimal solution. The path of the weighted graph problem definition of a balanced group to measure the degree of grouping of the balance.
Keywords :
approximation theory; graph theory; network theory (graphs); optimisation; railways; Dijkstra algorithm; Zhengzhou; approximate optimal solution; approximation algorithms; balance grouping degree measurement; capital cities; municipalities; network analysis; optimal path; research problems; starting point; weighted graph problem; Approximation algorithms; Approximation methods; Cities and towns; Educational institutions; Inspection; Rail transportation; Roads; Hamilton circuit; approximation algorithm; balanced degrees; best circuit problems; weighted graph;
Conference_Titel :
Consumer Electronics, Communications and Networks (CECNet), 2013 3rd International Conference on
Conference_Location :
Xianning
Print_ISBN :
978-1-4799-2859-0
DOI :
10.1109/CECNet.2013.6703357
