维普中文期刊产品整合服务
19篇 您的检索式:作者名="Yixun Lin"
    题名 作者 年代 出处 被引量
1A DEGREE SEQUENCE METHOD FOR THE CUTWIDTH PROBLEM OF GRAPHS显示文摘The cutwidth problem fora graph G is to embed G into a path such thatthe maximum number of overlap edges is minimized.This paperpresents an approach based on the degree se- quence of G for determining the exact value of cutwidth of typical graphs (e.g.,n- cube,cater- pillars) .Relations between the cutwidth and other graph- theoretic parameters are studied asLin Yixun Li Xianglu Yang Aifeng 2002Applied Mathematics(A Journal of Chinese Universities)2002,17,2:2
2MINIMUM PROFILE OF GRID NETWORKS显示文摘MINIMUMPROFILEOFGRIDNETWORKS¥LINYixun;YUANJinjiang(DeportmentofMathematics,ZhengzhouUniversity,Zhengzhou450052,China)Abstract...LIN Yixun YUAN Jinjiang(Department of Mathematics, Zhengzhou University, Zhengzhou 450052, China) 1994Systems Science and Mathematical Sciences1994,7,1:2
3On density lower bounds of two dimensional bandwidth显示文摘Lin Yixun 1996J Mathematical Research and Exposition1996,,3:1
4Recognizing Kekule structures in polycyclic aromatic hydrocarbons 显示文摘Yixun Lin Fuji Zhang 1995J Mol Struct (Theochen)1995,342,:1
5On characterization of graph bandwidth显示文摘Lin Yixun 2000OR Transactions2000,4,:1
6A class of bottleneck expansion problems显示文摘Jianzhong Zhang Chao Yang Yixun Lin 2000Computers and Operations Research2000,,6:1
7A class of bottleneck expansion problems显示文摘Jianzhong Zang Chao Yang Yixun Lin 2001Computers & Operations Reseach2001,28,:1
8A class of bottleneck expansion problems 显示文摘Zhang Jiangzhong Yang Chao Lin Yixun 2001Computers & Operations Reseach2001,28,:1
9Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan 显示文摘Cheng He Lin Yixun Yuan Jinjiang 2007Theoretical Computer Science2007,381,13:1
10THE CYCLIC BANDWIDTH PROBLEM显示文摘THECYCLICBANDWIDTHPROBLEM¥LINYixun(DepartmentofMathematics,ZhengzhouUniversity,Zhezhou450052,China)Abstract:Thecyclicbandwidt...LIN Yixun (Department of Mathematics, Zhengzhou University, Zhezhou 450052, China) 1994Systems Science and Mathematical Sciences1994,7,3:1
11Optimal batching structures of scheduling problems with fix batch number显示文摘Li Wenhua Yuan Jinjiang Lin Yixun 2007J of Zhengzhou Univ:Nat Sci Ed2007,39,2:1
12Two-dimensional bandwidth problem for graph products显示文摘Wang Minjuan Lin Yixun 1996J Mathematical Study1996,,3:1
13On density lower bounds of two dimensional bandwidth显示文摘Lin Yixun 1996J Mathematical Research & Exposition1996,,3:1
14A class of bottleneck expansion problems 显示文摘Zhang Jianzhong Yang Chao Lin Yixun 2001Computer & Opera- tions Research2001,28,6:1
15Weight re- duction problems with certain bottleneck objectives 显示文摘Burkard R E Lin Yixun Zhang Jianzhong 2004European Journal of Operational Research2004,153,1:1
16Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria 显示文摘Jinjiang Yuan Yixun Lin 2005European Journal of Operational Research2005,,164:1
17DEGENERATE OPTIMAL BASIS GRAPHS IN LINEAR PROGRAMMING显示文摘The basis graph \%G\% for a linear programming consists of all bases under pivot transformations. A degenerate optimal basis graph G * is a subgraph of \%G\% induced by all optimal bases at a degenerate optimal vertex x 0. In this paper, several conditions for the characterization of G * are presented.Lin Yixun\ Wen JianjunDept.of Math.,Zhengzhou Univ.,Zhengzhou450 0 52 . 2000Applied Mathematics(A Journal of Chinese Universities)2000,15,2:1
18A class of bottleneck expansion problems显示文摘Jianzhong Zhang Chao Yang Yixun Lin 2001Computer and Operations Research2001,28,:1
19THE BANDWIDTH OF THE COMPLEMENT OF A K-TREE显示文摘§1IntroductionThegraphsconsideredinthispaperarefiniteandsimple.ForagraphG,itsvertexsetandedgesetaredenotedbyV(G)andE(G)respec...YUAN JINJIANG AND LIN YIXUN 1998Applied Mathematics(A Journal of Chinese Universities)1998,13,4:0
返回顶部 每页显示:
共1页 首页 上一页 第1页 下一页 末页 /1 跳转

网站首页 | 关于我们 | 联系我们 | 产品服务 | 客服中心 | 广告服务 | 版权声明 | 网站联盟 | 友情链接 | 售卡网点

版权所有© 渝B2-20050021-1 渝公网安备 50019002500403号 违法和不良信息举报中心

互联网出版许可证 新出网证(渝)字10号 全国400电话 - 免长途话费