摘要
利用线图的概念,把中国邮递员问题转化成求顶点赋权图的最优完全子图的问题.
With the concept of the line graph , the problem of solving Chinese postman problem is changed into the problem of solving the optimal complete subgraph of a graph whose vertices are weighted.
出处
《上海师范大学学报（自然科学版）》
2006年第4期26-29,共4页
Journal of Shanghai Normal University(Natural Sciences)
关键词
最优邮递路线
最短路
最优匹配
线图
最优完全子图
optimal post route
shortest path
optimal matching
line gaph
optimal complete subgaph
