The deadline for the workshop is
We receive the LEDA please contact me (Liam) to receive a copy.
Here I add a project named my_demo which works with two different files.
The first one is the file my_demo.c which contains the simple example word_count
from the book or from the getting started. The second file is my_demo1.c which contains one
of the implementation of dijkstra algorithm (the one under directory \test\graph)
all the files pass compilation.
The workshop hours:
Prof. Uri Zwick
(9610) Wednesday
Wednesday
Liam Roditty (5398)
Tuesday
Please try to schedule it with us from advance.
Email list:
http://listserv.tau.ac.il/archives/cs0368-3500-18.html
Please add your email to the email list.
Theoretical papers
An On-Line Edge-Deletion Problem
Yossi
Shiloach and Shimon Even
Journal of the ACM (JACM) Volume 28 , Issue 1.
Finding
Paths and Deleting Edges in Directed Acyclic Graphs.
Giuseppe F.
Italiano
Information Processing Letters 28(1): 5
Improved dynamic reachability algorithms for directed graphs.
L. Roditty and U Zwick.
In Proceedings of the 43th Annual IEEE Symposium on
Foundations of Computer Science,
A faster and simpler fully dynamic transitive closure.
L. Roditty
In Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms,
Experimental papers
An Experimental Study of Dynamic Algorithms for Transitive Closure.
D. Frigioni, T. Miller, U. Nanni, C. Zaroliagis
To appear on ACM Journal on Experimental Algorithmics, ACM.
Theoretical papers
An On-Line Edge-Deletion Problem
Yossi
Shiloach and Shimon Even
Journal of the ACM (JACM) Volume 28 , Issue 1(1981).
Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications.
Greg N. Frederickson
Sparsification - a technique for speeding up dynamic graph algorithms.
David Eppstein, Zvi Galil, Giuseppe F. Italiano, Amnon Nissenzweig:
JACM 44(5): 669-696 (1997)
Randomized fully dynamic graph algorithms with polylogarithmic time per operation
Monika Rauch Henzinger, Valerie King
JACM 46(4): 502-516 (1999)
Jacob Holm , Kristian de Lichtenberg and Mikkel Thorup
JACM 48(4): 723-760 (2001)
Experimental papers
An empirical study of dynamic
graph algorithms
David Alberts,
Giuseppe Cattaneo, and Giuseppe. F. Italiano
Journal of Experimental Algorithmics (JEA)}, 2:5, 1997.
Scaling Algorithms for the Shortest Paths Problem
V. Goldberg
SIAM Journal on Computing, Vol. 24, pages 494-504, May 1995.
All Pairs Almost Shortest Paths
Dorit Dor, Shay Halperin, Uri Zwick,
SIAM Journal on Computing 29, 1740-1759 (2000).
Edith Cohen, Uri Zwick
Proc. of 8th SODA (1997), 93-102.
Mikkel Thorup, Uri Zwick,
Proc. of 33rd STOC (2001), 183-192.
Workshop on Algorithm Engineering and Experiments (ALENEX) ALENEX 2002
Workshop on Algorithm Engineering (WAE) WAE 2002
ACM Journal on Experimental Algorithms (JEA)
Leda (A platform for combinatorial and geometric computing)