摘要
本文定义了一类特殊平面图形G（ω）和规则f，提出了“桥”问题和赋权桥问题把这两类问题分别转化为限制整序问题和赋权限制整序问题并提出相应算法．
This paper defines a particular type of graph G(ω) and the rule f. Based on this we raise the bridge problem and the weighted bridge problem, and successfully transfrom these two problems into the restricted sorting problem and weighted restricted sorting problem respectively.
出处
《长沙铁道学院学报》
EI
CSCD
1997年第2期47-51,共5页
Journal of Changsha Railway University
基金
国家自然科学基金
关键词
限制整序
赋权限制整序
赋权桥
排序
桥问题
restricted sorting, weighted restricted sorting, neighbouring changing
