You have Guest access.
Log In
Daniele Frigioni, Tobias Miller, Umberto Nanni, Giulio Pasqualone, Guido Schaefer and Christos Zaroliagis
Book Chapter
On-line graph algorithms for incremental compilation
Alberto Marchetti-Spaccamela, Umberto Nanni and Hans Rohnert
Lecture Notes in Computer Science, 1994, Volume 790, Graph-Theoretic Concepts in Computer Science, Pages 70-86
Journal Article
Speeding up dynamic transitive closure for bounded degree graphs
Daniel M. Yellin
Acta Informatica, 1993, Volume 30, Number 4, Pages 369-384
Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure
Camil Demetrescu and Giuseppe F. Italiano
Algorithmica, 2008, Volume 51, Number 4, Pages 387-427
Associative Version of Italiano’s Decremental Algorithm for the Transitive Closure Problem
Anna Nepomniaschaya
Lecture Notes in Computer Science, 2007, Volume 4671, Parallel Computing Technologies, Pages 442-452
Maintaining biconnected components of dynamic planar graphs
Zvi Galil and Giuseppe F. Italiano
Lecture Notes in Computer Science, 1991, Volume 510, Automata, Languages and Programming, Pages 339-350
Average case analysis of fully dynamic connectivity for directed graphs
Paola Alimonti, Stefano Leonardi, Alberto Marchetti-Spacccamela and Xavier Messeguer
Lecture Notes in Computer Science, 1994, Volume 790, Graph-Theoretic Concepts in Computer Science, Pages 87-98
Counting edges in a dag
Serafino Cicerone, Daniele Frigioni, Umberto Nanni and Francesco Pugliese
Lecture Notes in Computer Science, 1997, Volume 1197, Graph-Theoretic Concepts in Computer Science, Pages 85-100
A data structure for arc insertion and regular path finding
Adam L. Buchsbaum, Paris C. Kanellakis and Jeffrey Scott Vitter
Annals of Mathematics and Artificial Intelligence, 1991, Volume 3, Numbers 2-4, Pages 187-210
A fully dynamic data structure for reachability in planar digraphs
Sairam Subramanian
Lecture Notes in Computer Science, 1993, Volume 726, Algorithms—ESA '93, Pages 372-383
Maintenance of triconnected components of graphs Extended abstract
J. A. La Poutré
Lecture Notes in Computer Science, 1992, Volume 623, Automata, Languages and Programming, Pages 354-365
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info