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

22篇 您的检索式：期刊名="ACM Journal of Experimental Algorithms"

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

	题名	作者	年代	出处	被引量
1	SHARC:Fast and robust unidirectionalrouting显示文摘	BAUER R DELLING D	2009	ACM Journal of Experimental Algorithmics2009，14，12：	1
2	Shortest-path Feasibility Algorithms:An Experimental Evaluation显示文摘	Cherkassky B V Georgiadis L Goldberg A	2009	ACM Journal of Experimental Algorithmics2009，14，2：	1
3	Approximate minimum enclosing balls in high dimensions using core-sets显示文摘	KUMAR P MITCHELL J S B YILDIRIM E A	2003	The ACM Journal of Experimental Algorithmics2003，8，1：	1
4	Finding the chromatic number by means of critical graphs显示文摘	Herrmann F Hertz A	2002	ACM Journal of Experimental Algorithmics2002，7，：	1
5	Fast and flexible string matching by combining bit-parallelism and suffix automata显示文摘	NAVARRO G RAFFINOT M	2000	ACM Journal of Experimental Algorithmics2000，5，4：	1
6	Shortest-path feasibility algorithm : an experimental evaluation 显示文摘	CHERKASSKY B V GEORGIADIS L GOLDBERG A V	2009	ACM Journal of Experimental Algorithmics2009，14，2：	1
7	Fast and flexible string matching by combining bit-parallelism and suffix automata显示文摘	Navarro G Raffinot M	2000	ACM Journal of Experimental Algorithmics(JEA)2000，5，4：	1
8	Multi-pattern String Matching with q-grams显示文摘	Salmela L Tarhio J Kyt?joki J	2006	ACM Journal of Experimental Algorithmics2006，11，1：	1
9	Fast and Flexible String Matching by Combining Bit-parallelism and Suffix Automata 显示文摘	Navarro G Raffinot M	2000	ACM Journal of Experimental Algorithmics(JEA)2000，5，4：	1
10	Experimental Analysis of Dynamic Algorithms for the Single-Source Shortest-Path Problem显示文摘	Frigioni D Ioffreda M Nanni U	1998	ACM Journal of Experimental Algorithms1998，3，5：	1
11	Augment or push? a computational study of bipartite matching and unit capacity maximum flow algorithms显示文摘	Cherkassky B V Goldberg A V Martin P	1998	ACM Journal of Experimental Algorithmics1998，38，：	1
12	Goal-Directed Shortest-Path Queries Using Preeomputed Cluster Distances显示文摘	Maue J Sanders P Matijevic D	2009	ACM Journal of Experimental Algorithmics2009，14，3：	1
13	Finding the chromatic number by means of critical graphs 显示文摘	Francine Herrmann Alain Hertz	2002	ACM Journal of Experimental Algorithms2002，，7：	1
14	Share:Fast and robust unidirectional routing 显示文摘	Bauer R Delling D	2009	ACM Journal of Experimental Algorithmics2009，14，4：	1
15	Efficient Sorting Using Registers and Caches显示文摘	Wickremesinghe R Arge L Chase J	2002	ACM Journal of Experimental Algorithmics2002，7，9：	1
16	Short- est-Path Feasibility Algorithms: An Experimental Evaluation 显示文摘	Cherkassky B V Georgiadis L Goldberg A	2009	ACM Journal of Experimental Algorithmics2009，，14：	1
17	Fast and Flexible String Matching by Combining Bit-parallelism and Suffix Automata显示文摘	Navarro G Raffinot M	2000	ACM Journal of Experimental Algorithmics2000，5，4：	1
18	Generating Node Coordinates for Shortest - Path Computations in Transportation Networks显示文摘	Brandes U	2004	ACM Journal of Experimental Algorithmics2004，9，1：	1
19	Approximate minimum enclosing balls in high dimensions using corsets显示文摘	KUMAR P MITCHELL J S B YILDIRIM E A	2003	ACM Journal of Experimental Algorithmic2003，8，：	1
20	Approximate minimum enclosing balls in high dimensions using core- sets显示文摘	Kumar P Mitchell J S B Ylldlrlm E A	2003	The ACM Journal of Experimental Algorithmics2003，8，1：	1

返回顶部每页显示：

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

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

用户提示