Zobrazeno 1 - 10
of 173
pro vyhledávání: '"Nilsen, Christian"'
Autor:
Le, Hung, Wulff-Nilsen, Christian
A recent line of work on VC set systems in minor-free (undirected) graphs, starting from Li and Parter, who constructed a new VC set system for planar graphs, has given surprising algorithmic results. In this work, we initialize a more systematic stu
Externí odkaz:
http://arxiv.org/abs/2304.01790
Autor:
Goranci, Gramoz, Henzinger, Monika, Nanongkai, Danupon, Saranurak, Thatchaphol, Thorup, Mikkel, Wulff-Nilsen, Christian
Given a simple $n$-vertex, $m$-edge graph $G$ undergoing edge insertions and deletions, we give two new fully dynamic algorithms for exactly maintaining the edge connectivity of $G$ in $\tilde{O}(n)$ worst-case update time and $\tilde{O}(m^{1-1/31})$
Externí odkaz:
http://arxiv.org/abs/2302.05951
We present a randomized algorithm that computes single-source shortest paths (SSSP) in $O(m\log^8(n)\log W)$ time when edge weights are integral and can be negative. This essentially resolves the classic negative-weight SSSP problem. The previous bou
Externí odkaz:
http://arxiv.org/abs/2203.03456
Given an $n$-vertex planar embedded digraph $G$ with non-negative edge weights and a face $f$ of $G$, Klein presented a data structure with $O(n\log n)$ space and preprocessing time which can answer any query $(u,v)$ for the shortest path distance in
Externí odkaz:
http://arxiv.org/abs/2111.07360
Autor:
Le, Hung, Wulff-Nilsen, Christian
A $(1+\epsilon)$-approximate distance oracle of an edge-weighted graph is a data structure that returns an approximate shortest path distance between any two query vertices up to a $(1+\epsilon)$ factor. Thorup (FOCS 2001, JACM 2004) and Klein (SODA
Externí odkaz:
http://arxiv.org/abs/2111.03560
Effect of Artificial Tears on Preoperative Keratometry and Refractive Precision in Cataract Surgery.
Autor:
Nilsen, Christian (AUTHOR), Gundersen, Morten (AUTHOR), Jensen, Per Graae (AUTHOR), Gundersen, Kjell Gunnar (AUTHOR), Potvin, Richard (AUTHOR), Utheim, Øygunn A (AUTHOR), Gjerdrum, Bjørn (AUTHOR)
Publikováno v:
Clinical Ophthalmology. May2024, Vol. 18, p1503-1514. 12p.
Given an undirected $n$-vertex planar graph $G=(V,E,\omega)$ with non-negative edge weight function $\omega:E\rightarrow \mathbb R$ and given an assigned label to each vertex, a vertex-labeled distance oracle is a data structure which for any query c
Externí odkaz:
http://arxiv.org/abs/2110.00074
Publikováno v:
Am. Math. Mon., 2020, 127(10): 880-896
We consider the following game played in the Euclidean plane: There is any countable set of unit speed lions and one fast man who can run with speed $1+\varepsilon$ for some value $\varepsilon>0$. Can the man survive? We answer the question in the af
Externí odkaz:
http://arxiv.org/abs/2012.11181
Autor:
Jensen, Per (AUTHOR), Nilsen, Christian (AUTHOR), Gundersen, Morten (AUTHOR), Gundersen, Kjell Gunnar (AUTHOR), Potvin, Rick (AUTHOR), Gazerani, Parisa (AUTHOR), Chen, Xiangjun (AUTHOR), Utheim, Tor P (AUTHOR), Utheim, Øygunn A (AUTHOR)
Publikováno v:
Clinical Ophthalmology. Feb2024, Vol. 18, p591-604. 14p.
Autor:
Evald, Jacob, Fredslund-Hansen, Viktor, Gutenberg, Maximilian Probst, Wulff-Nilsen, Christian
Given a directed graph $G = (V,E)$, undergoing an online sequence of edge deletions with $m$ edges in the initial version of $G$ and $n = |V|$, we consider the problem of maintaining all-pairs shortest paths (APSP) in $G$. Whilst this problem has bee
Externí odkaz:
http://arxiv.org/abs/2010.00937