Publikationsansicht

Improved (2003)

Abstract

decremental algorithms for maintaining transitive closure and all-pairs shortest paths A

Details der Publikation

Download	http://citeseerx.ist.psu.edu/viewdoc/summary?doi=?doi=10.1.1.106.7546
Quelle	http://eprint.iitd.ac.in/dspace/bitstream/2074/1498/1/baswanaimp2004.pdf
Mitarbeiter	CiteSeerX
Archiv	CiteSeerX - Scientific Literature Digital Library and Search Engine (United States)
Keywords	BFS tree, Dynamic, Graph, Transitive closure, Shortest paths
Typ	text
Sprache	Englisch
Verknüpfungen	10.1.1.114.4650, 10.1.1.10.7787, 10.1.1.132.6191, 10.1.1.44.4485, 10.1.1.1.9247, 10.1.1.40.5986, 10.1.1.9.5574, 10.1.1.16.4608, 10.1.1.5.9059, 10.1.1.12.2454