J.A. La Poutré, J. van Leeuwen  Home/Search
Context Related
Links: ACM DBLP | archive.cs.uu.nl/pub/RUU/...198725.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.uu.nl/resear...EAR=&AUTH=&GRP= (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper appeared in the Proceedings of the 13th lat. Workshop on "Graph-Theoretic Concepts in Computer Science" (WG '87), June 29 July 1, 1987, Kloster Banz/Staffelstein (FIG), published as: Lecture Notes in Computer Science, Vol. 314, Springer-Verlag, Berlin, 1988, pp. 106 - 120 (Update)
Context of citations to this paper: More
.... Significant progress has been recently made in the design of algorithms and data structures for dynamic graphs [1, 5, 6, 8, 11, 12, 13, 16, 17, 18, 19, 20, 21, 24]. These data structures support insertions and deletions of edges and or nodes in a graph, in addition to several...
Cited by: More
Fully Dynamic Transitive Closure: - Breaking Through The (Correct)
A Uniform Approach to Semi-Dynamic Problems on Digraphs - Cicerone, Frigioni.. (1998) (Correct)
Improved Dynamic Reachability Algorithms for Directed Graphs - Roditty, Zwick (2002) (Correct)
Active bibliography (related documents): More All
0.0: A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005) (Correct)
0.0: Maintaining Biconnected Components of Dynamic Planar Graphs - Galil, Italiano (1991) (Correct)
0.0: Dynamic Graph Algorithms - Eppstein, Galil, Italiano (1999) (Correct)
Similar documents based on text: More All
0.4: Procedure Based Help Desk System - Takano, Yurugi (Correct)
0.3: A Parallel Algorithm for Generating Discrete Orthogonal.. - Egecioglu, Koc (1992) (Correct)
0.3: Proving Noninterference and Functional Correctness Using Traces - John Mclean (1992) (Correct)
Related documents from co-citation: More All
20: Amortized efficiency of a path retrieval data structure (context) - Italiano - 1986
19: Finding Paths and Deleting Edges in Directed Acyclic Graphs (context) - Italiano - 1988
14: Line Computation of Transitive Closures of Graphs (context) - Ibaraki, Katoh - 1983
BibTeX entry: (Update)
J. A. La Poutr'e and J. van Leeuwen. Maintenance of transitive closure and transitive reduction of graphs. In Proc. Workshop on Graph-Theoretic Concepts in Computer Science, pages 106--120. Springer-Verlag (LNCS 314), 1988. http://citeseer.ist.psu.edu/poutre87maintenance.html More
@inproceedings{ e88maintenance,
author = "J. A. {La Poutr\'e} and J. van Leeuwen",
title = "Maintenance of transitive closure and transitive reduction of graphs",
booktitle = "Proc. Workshop on Graph-Theoretic Concepts in Computer Science",
publisher = "Lecture Notes in Computer Science 314, Springer-Verlag, Berlin",
pages = "106--120",
year = "1988",
url = "citeseer.ist.psu.edu/poutre87maintenance.html" }
Citations (may not include all citations):405 Depth-first search and linear graph algorithms (context) - Tarjan - 1972 DBLP
62 The transitive reduction of a directed graph (context) - Aho, Garey et al. - 1972 DBLP
27 line computation of transitive closures of graphs (context) - Ibaraki, Katoh - 1983
1 ation of the all pairs least cost path problem (context) - ohnert, dynami - 1985
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.uu.nl/research/techreps/techreps.php?submit=show+reports&YEAR=&AUTH=&GRP=): More
On the Two-Level Uncapacitated Facility Location Problem - Aardal, Labbé (1995) (Correct)
A Tourist Guide through Treewidth - Bodlaender (1993) (Correct)
Predictive Probabilistic Models for Treatment Planning in.. - Peek (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC