scientific article
From MaRDI portal
Publication:3813313
zbMath0662.68071MaRDI QIDQ3813313
Jan van Leeuwen, Johannes A. La Poutré
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20)
Related Items
Representation and management of MOEA populations based on graphs, Modular materialisation of Datalog programs, NC algorithms for dynamically solving the all pairs shortest paths problem and related problems, Dynamic shortest paths and transitive closure: algorithmic techniques and data structures, Finding paths and deleting edges in directed acyclic graphs, On-line graph algorithms for incremental compilation, Average case analysis of fully dynamic connectivity for directed graphs, Dynamic maintenance of planar digraphs, with applications, Dynamic maintenance of directed hypergraphs, Mantaining dynamic matrices for fully dynamic transitive closure, A special case the of dynamization problem for least cost paths, Maintenance of 2- and 3-edge-connected components of graphs. I, Dynamic reachability in planar digraphs with one source and one sink, A fully dynamic algorithm for maintaining the transitive closure, Maintenance of triconnected components of graphs, A uniform approach to semi-dynamic problems on digraphs, Average case analysis of fully dynamic reachability for directed graphs, Maintaining a topological order under edge insertions
