维普期刊资源整合服务平台（V6.5）

维普中文期刊产品整合服务

16篇 您的检索式：期刊名="SIAM Journal on Algebraic Discrete Methods"

选中清除导出查看参考文献查看引证文献引用追踪共1页首页上一页第1页下一页末页 /1 跳转

		题名	作者	年代	出处	被引量
	1	Integer rounding for polymatroid and branching optimization problems 显示文摘	Baum S Trotter L E	1981	SIAM Journal on Algebraic and Discrete Methods1981，2，4：	1
	2	On additive bases and harmonious graphs显示文摘	GRAHAM R L SLOANE N J A	1980	SIAM Journal on Algebraic Discrete Methods1980，1，4：	1
	3	An Algorithm for Partitioning the Nodes of a Graph 显示文摘	Barnes E R	1982	SIAM Journal on Algebraic Discrete Methods1982，3，4：	1
	4	An algorithm for partitioning the nodes of a graph显示文摘	BAMES E R	1982	SIAM Journal on Algebraic and Discrete Methods1982，17，5：	1
	5	Multi-splittings of matrices and parallel solution of linear systems 显示文摘	O'Leary D P White R E	1985	SIAM Journal on Algebraic and Discrete Methods1985，6，：	1
	6	An algorithm for partitioning the nodes of a graph 显示文摘	Barnes E R	1982	Siam Journal on Algebraic & Discrete Methods1982，3，4：	1
	7	Equilibria on a congested transportation networks显示文摘	Aashtiani H Z Magnanti T L	1981	SIAM Journal on Algebraic and Discrete Methods1981，，2：	1
	8	Complexity of finding embedding in a k-tree 显示文摘	ARNBORG S CORNEIL D G PROSKUROWSKI A	1987	SIAM Journal on Algebraic and Discrete Methods1987，8，2：	1
	9	Computing the Minimum Fill-In Is NP-Complete显示文摘	Yannakakis M	1981	SIAM Journal on Algebraic and Discrete Methods1981，2，1：	1
	10	Crossing numbers is NP- complete 显示文摘	Garey M R Johnson D S	1983	SIAM Journal on Algebraic and Discrete Methods1983，4，3：	1
	11	Scheduling to maximize the minimum processor finish time in a multiprocessor system显示文摘	Deuernyer B Friesen D Langston M	1982	SIAM Journal on Algebraic and Discrete Methods1982，3，2：	1
	12	The k-domination and k-stability problems in sun-free chordal graphs 显示文摘	Chang G J Nemhauser G L	1984	SIAM Journal on Algebraic Discrete Methods1984，5，：	1
	13	Womt-case analysis of network design problem heuristics 显示文摘	Wong R	1980	SIAM Journal on Algebraic and Discrete Methods1980，1，1：	1
	14	Efficient vertex and edge coloring of outerplanar graphs显示文摘	PROSKUROWSKI SYSLO M M	1986	SIAM Journal on Algebraic and Discrete Methods1986，7，1：	1
	15	The maximum coverage location problem显示文摘	Megiddo N Zemel E Hakimi S L	1983	SIAM Journal on Algebraic and Discrete Methods1983，4，：	1
	16	Integer rounding for polymatroid and branching optimization problems显示文摘	TROTTER L E	1981	SIAM Journal on Algebraic and Discrete Methods1981，2，：	1

返回顶部每页显示：

共1页首页上一页第1页下一页末页 /1 跳转

goolge学术搜索-维普

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

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

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