Zobrazeno 1 - 10
of 70
pro vyhledávání: '"Kowaluk, Mirosław"'
Autor:
Kowaluk, Mirosław, Lingas, Andrzej
We consider the fundamental problem of detecting/counting copies of a fixed pattern graph in a host graph. The recent progress on this problem has not included complete pattern graphs, i.e., cliques (and their complements, i.e., edge-free pattern gra
Externí odkaz:
http://arxiv.org/abs/2109.14876
Autor:
Oronowicz-Jaśkowiak, Wojciech, Kozłowski, Tomasz, Polańska, Marta, Wojciechowski, Jerzy, Wasilewski, Piotr, Ślęzak, Dominik, Kowaluk, Mirosław
Publikováno v:
In Journal of Forensic and Legal Medicine January 2024 101
Autor:
Kowaluk, Mirosław, Lingas, Andrzej
The problem of finding maximum (or minimum) witnesses of the Boolean product of two Boolean matrices (MW for short) has a number of important applications, in particular the all-pairs lowest common ancestor (LCA) problem in directed acyclic graphs (d
Externí odkaz:
http://arxiv.org/abs/2004.14064
Autor:
Kowaluk, Mirosław1 (AUTHOR) kowaluk@mimuw.edu.pl, Lingas, Andrzej2 (AUTHOR) Andrzej.Lingas@cs.lth.se
Publikováno v:
International Journal of Foundations of Computer Science. Nov2024, Vol. 35 Issue 7, p871-886. 16p.
Autor:
Kowaluk, Mirosław
We present a new algorithm for lune-based $\beta$-skeletons for sets of $n$ points in the plane, for $\beta \in (2,\infty]$, the only case when optimal algorithms are not known. The running time of the algorithm is $O(n^{3/2} \log^{1/2} n)$, which is
Externí odkaz:
http://arxiv.org/abs/1411.5459
Autor:
Kowaluk, Mirosław, Majewska, Gabriela
$\beta$-skeletons are well-known neighborhood graphs for a set of points. We extend this notion to sets of line segments in the Euclidean plane and present algorithms computing such skeletons for the entire range of $\beta$ values. The main reason of
Externí odkaz:
http://arxiv.org/abs/1411.5457
Autor:
Kowaluk, Mirosław, Majewska, Gabriela
$\beta$-skeletons, a prominent member of the neighborhood graph family, have interesting geometric properties and various applications ranging from geographic networks to archeology. This paper focuses on developing a new, more general than the prese
Externí odkaz:
http://arxiv.org/abs/1411.5455
Autor:
Kowaluk, Mirosław, Majewska, Gabriela
The $\beta$-skeleton $\{G_{\beta}(V)\}$ for a point set V is a family of geometric graphs, defined by the notion of neighborhoods parameterized by real number $0 < \beta < \infty$. By using the distance-based version definition of $\beta$-skeletons w
Externí odkaz:
http://arxiv.org/abs/1411.5472
Autor:
Kowaluk, Mirosław1 (AUTHOR), Lingas, Andrzej2 (AUTHOR) andrzej.lingas@cs.lth.se
Publikováno v:
Algorithms. Dec2022, Vol. 15 Issue 12, p448. 12p.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.