Search Sciweavers | Sciweavers

108 search results - page 2 / 22

» Hybrid Transitive Closure Algorithms

click to vote

COCOON
2001
Springer

114views Combinatorics» more COCOON 2001»

A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms

14 years 3 months ago

Download www.cs.ust.hk

We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...

Valerie King, Mikkel Thorup

claim paper

Read More »

click to vote

JDA
2006

184views more JDA 2006»

Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures

13 years 10 months ago

Download www.dis.uniroma1.it

In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...

Camil Demetrescu, Giuseppe F. Italiano

claim paper

Read More »

click to vote

STOC
2002
ACM

144views Algorithms» more STOC 2002»

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

14 years 11 months ago

Download eprints.iisc.ernet.in

We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...

Surender Baswana, Ramesh Hariharan, Sandeep Sen

claim paper

Read More »

click to vote

ESA
2005
Springer

99views Algorithms» more ESA 2005»

An Experimental Study of Algorithms for Fully Dynamic Transitive Closure

14 years 4 months ago