2 hasil untuk "Eva Rotenberg"
Menampilkan 1–2 · 0,26 detik · RSS
-
Artikel Jurnal
On the discrete Fréchet distance in a graph
The Fréchet distance is a well-studied similarity measure between curves that is widely used throughout computer science. Motivated by applications where curves stem from paths and walks on an underlying graph (such as a road network), we define and study the Fréchet distance for paths and walks on…
-
Artikel Jurnal
Worst-case deterministic fully-dynamic biconnectivity in changeable planar embeddings
We study dynamic planar graphs with $n$ vertices, subject to edge deletion, edge contraction, edge insertion across a face, and the splitting of a vertex in specified corners. We dynamically maintain a combinatorial embedding of such a planar graph, subject to connectivity and 2-vertex-connectivity…