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

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

18篇 您的检索式：作者名="Frigioni"

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

		题名	作者	年代	出处	被引量
	1	Semi -dynamic algorithms for maintaining singlesource shortest paths trees 显示文摘	FRIGIONI D MARCHETTI- S A NANNI U	1998	Algorithmica1998，，3：	1
	2	Experimental analysis of dynamic algorithms for the single source shortest paths problem显示文摘	FRIGIONI D IOFFREDA M NANNI U		0，，03：	1
	3	Partially Dynamic Maintenance of Minimum Weight Hyperpaths显示文摘	AUSIELLO G FRANCIOSA P G FRIGIONI D	2005	Journal of Discrete Algorithms2005，3，：	1
	4	Hybrid formulation of the equation systems of the 3-D PEEC model based on graph algorithms显示文摘	Antonini G Frigioni D Miscione G	2010	IEEE Transactions on Circuits and Systems-I: Regular Papers2010，57，1：	1
	5	A general strategy for decomposing topological invariants of spatial databases and an application显示文摘	Daniele Frigioni Paolino Di Felice	2001	Data & Knowledge Engineering2001，12，39：	1
	6	Semi- dynamic algorithms for maintaining single source shortest path trees显示文摘	Frigioni D Marchetti-Spaecamela A Nanni U	1998	Algorithmics1998，22，：	1
	7	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
	8	A fully dynamic algorithm for distributed shortest paths显示文摘	CICERONE S STEFANO G D FRIGIONI D	2003	Theoretical Computer Science2003，297，1：	1
	9	Fully dynamic algorithms for maintaining shortest paths trees 显示文摘	Frigioni Daniele	2000	Journal of Algorithms2000，34，2：	1
	10	Fully Dynamic Algorithms for Maintaining Shortest Paths Trees 显示文摘	Frigioni D Marchetti-Spaccamela A Nanni U	2000	Journal of Algorithms2000，34，2：	1
	11	Fully dynamic algorithms for maintaining shortest paths trees显示文摘	Frigioni D	2000	Journal of Algorithms2000，34，：	1
	12	Semi- dynamic Breadth: First Search in Digraphs 显示文摘	FRANCIOSA P G FRIGIONI D GIACCIO R	2001	Theoretical Computer Science2001，250，12：	1
	13	Semidynamic algorithms for maintaining single-source shortest path trees显示文摘	FRIGIONI D MARCHETTI-SPACCAMELA A NANNI U		0，，：	1
	14	Fully dynamic algorithms for maintaining shortest paths trees 显示文摘	Daniele Frigioni Alberto Marchetti-Spaccamela Nanni Umberto	2000	Journal ofAlgorithms2000，34，2：	1
	15	Semi-dynamic breadth-first search in dig-raphs显示文摘	Paolo Giulio Franciosa Frigioni Daniele	2001	Theoretical Computer Science2001，250，12：	1
	16	Fully dynamic algorithms for maintaining shortest paths trees 显示文摘	Frigioni D Marchetti-Spaccamela A Nanni U	2000	Journal of Algorithms2000，34，2：	1
	17	Semi-dynamic shortest paths and breadth-first search in digraph显示文摘	Franciosa P Frigioni D Giaccio R		0，，：	1
	18	Fully dynamic output hounded single source path problem显示文摘	Frigioni D Marchetti-Spaccamela A Nanni U		0，，02：	1

返回顶部每页显示：

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

goolge学术搜索-维普

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

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

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