G. F. Italiano, D. Eppstein, and Z. Galil. Dynamic graph algorithms. In Algorithms and Theory of Computation Handbook, CRC Press. 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Interactive Co-Design of High Throughput Embedded Multimedia - Omnes, Franzetti, Catthoor (2000) (Correct)
....based on the FDS algorithm, we proposed an extension called Conflict Directed Ordering (CDO) 13] to address the highlevel synthesis of embedded multimedia ASICs. State of the art in CDO [14] reports a runtime complexity of O(n3ln(n)m) using advanced dynamic or localised graph techniques [ 11]. In the following, we propose to adapt our localised CDO (LCDO) technique to also address multimedia software systems using the design process illustrated in Figure 1. In a first step, a conven tional scheduler like LS can be run to estimate a reasonable real time budget. From the thereafter ....
D.Eppstein & al, "Dynamic graph algorithms", CRC Handbook of Algorithms and Theory of Computation, Chapter 8, 1999.
Bounded Degree Spanning Trees - Strothmann (1 citation) (Correct)
....and the structure (for example connectivity or planarity) changes. Nevertheless in some applications there are some important properties on the edge vertex set that should be reported quickly by queries. Thus in the last years there has been an extensive study in dynamic graph algorithms [EGI97] A problem is fully dynamic if insertion and deletion are allowed, incremental if only insertion is allowed, and decremental if only deletion is allowed. In this chapter we consider the biconnectivity problem, where the (main) query is to decide if two given vertices are biconnected. The fully ....
D. Eppstein, Z. Galil, and G. F. Italiano. Dynamic graph algorithms. In CRC Handbook of Algorithms and Theory, chapter 22. CRC Press, 1997.
Dynamic Computation - Husfeldt (1997) (Correct)
....Recent successes in the field include the technique of sparsification [18] and the efficient algorithm for dynamic reachability in undirected graphs of Henzinger and King [32] Albers, Cattaneo, and Italiano [4] report empirical results for dynamic graph algorithms. A forthcoming handbook chapter [17] provides an introduction with focus on undirected graphs, because designing efficient fully dynamic data structures for directed graphs has turned out to be an extremely difficult task. Nonetheless, in x1 we present an efficient algorithm for the dynamic reachability problem for the class of ....
David Eppstein, Zvi Galil, and Giuseppe F. Italiano. Dynamic graph algorithms. In Handbook of Algorithms and Theory of Computation, chapter 22. CRC Press, 1997.
New Results on Geometric Spanners and Their Applications - Lukovszki (1999) (7 citations) (Correct)
....deletion are allowed. This data structure supports the updates as fast as the selection of the important objects. Thereafter, we present our own deterministic contribution for the incremental problem, where only insertion is allowed. For a discussion about dynamic algorithms we refer to [65] and [37]. Our deterministic solutions have been published in [40] After this we consider a more general model, where the objects of the scene have different sizes. For the selection of important objects we first present an approximate solution which exploits the fact that the selection problem is a ....
D. Eppstein, Z. Galil, and G. F. Italiano. Dynamic graph algorithms. In CRC Handbook of Algorithms and Theory of Computation, Chapter 22. CRC Press, 1997. 95
Online Algorithms for Topological Order and Strongly Connected.. - Pearce (2003) (Correct)
No context found.
G. F. Italiano, D. Eppstein, and Z. Galil. Dynamic graph algorithms. In Algorithms and Theory of Computation Handbook, CRC Press. 1999.
Dynamic Capacitated Minimum Spanning Trees - Jothi, Raghavachari (2004) (Correct)
No context found.
D. Eppstein, Z. Galil and G.F. Italiano, "Dynamic graph algorithms," Algorithms and Theory of Computation Handbook, CRC Press, 1999.
A Dynamic Algorithm for Topologically Sorting Directed Acyclic .. - Pearce, Kelly (2004) (3 citations) (Correct)
No context found.
G. F. Italiano, D. Eppstein, and Z. Galil. Dynamic graph algorithms. In Algorithms and Theory of Computation Handbook, CRC Press. 1999.
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