检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《周口师范学院学报》2006年第5期5-8,共4页Journal of Zhoukou Normal University
基 金:国家自然科学基金资助项目(No.60373030)
摘 要:针对4-正则图的平面嵌入的纵横扩张的特殊性,某些4-正则图类的最小折数纵横扩张已经有了线性算法.本文通过基纵横扩张,提供了从一个4-正则图扩充为另一个4-正则图的方式,使得从原图的最小折数基纵横扩张自然导出扩充图的最小折数基纵横扩张.According to the properties of rectilinear extensions of 4-regular graphs, a linear time algorithm is designed to get rectilinear extensions of some particular kinds of 4-regular graphs with the minimum total number of bends. In this paper , a generalized algorithm is provided to extend a 4-regular graph to another 4-regular graph through base rectilinear extension, through which the base rectilinear extension with the minimum total number of bends of the extended ,t-regular graph is naturally obtained from that of the original one.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28