D. Frigioni and G. F. Italiano, Dynamically switching vertices in planar graphs, Algorithmica, 28(1) (2000), 76-103. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Dynamic Subgraph Connectivity with Geometric Applications - Chan (2002) (2 citations) (Correct)
....graph reachability [10] is computationally more demanding (the goal there was an o(n 2 ) update bound for dense graphs) Previous graph work. The dynamic subgraph connectivity problem has indeed been proposed before, as the author has learned afterwards, in a paper by Frigioni and Italiano [16]. The motivation there was on the connectivity of communication networks, where processors can become faulty and can later go back up; viewed alternatively, vertices can be switched on and o#. Frigioni and Italiano used the term complete dynamic graph model to describe the setting where both ....
D. Frigioni and G. F. Italiano. Dynamically switching vertices in planar graphs. Algorithmica, 28:76--103, 2000.
Extreme Distances in Multicolored Point Sets - Adrian Dumitrescu Yz (Correct)
No context found.
D. Frigioni and G. F. Italiano, Dynamically switching vertices in planar graphs, Algorithmica, 28(1) (2000), 76-103.
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