Zobrazeno 1 - 10
of 96
pro vyhledávání: '"Sokołowski Marek"'
Autor:
Chekan, Vera, Geniet, Colin, Hatzel, Meike, Pilipczuk, Michał, Sokołowski, Marek, Seweryn, Michał T., Witkowski, Marcin
For a group $\Gamma$, a $\Gamma$-labelled graph is an undirected graph $G$ where every orientation of an edge is assigned an element of $\Gamma$ so that opposite orientations of the same edge are assigned inverse elements. A path in $G$ is non-null i
Externí odkaz:
http://arxiv.org/abs/2408.16344
Autor:
SOKOŁOWSKI MAREK
Publikováno v:
Наука телевидения, Vol 15.3, Pp 57-72 (2019)
The purpose of this article is to recall the significance of the Olsztyn Deaf Pantomime in Polish theatre culture, and a special role in its creation of professor Bohdan Głuszczak, who was an actor, theatre director, and artistic visionary. Profess
Externí odkaz:
https://doaj.org/article/3c3dc8fee21243c5a45b87b43d742a44
Autor:
Korhonen, Tuukka, Sokołowski, Marek
We give an algorithm that given a graph $G$ with $n$ vertices and $m$ edges and an integer $k$, in time $O_k(n^{1+o(1)}) + O(m)$ either outputs a rank decomposition of $G$ of width at most $k$ or determines that the rankwidth of $G$ is larger than $k
Externí odkaz:
http://arxiv.org/abs/2402.12364
It is known that for subgraph-closed graph classes the first-order model checking problem is fixed-parameter tractable if and only if the class is nowhere dense [Grohe, Kreutzer, Siebertz, STOC 2014]. However, the dependency on the formula size is no
Externí odkaz:
http://arxiv.org/abs/2401.16230
Exact computation of shortest paths in weighted graphs has been traditionally studied in one of two settings. First, one can assume that the edge weights are real numbers and all the performed operations on reals (typically comparisons and additions)
Externí odkaz:
http://arxiv.org/abs/2311.03321
The classic technique of Baker [J. ACM '94] is the most fundamental approach for designing approximation schemes on planar, or more generally topologically-constrained graphs, and it has been applied in a myriad of different variants and settings thr
Externí odkaz:
http://arxiv.org/abs/2310.20623
Autor:
Bergougnoux, Benjamin, Gajarský, Jakub, Guśpiel, Grzegorz, Hliněný, Petr, Pokrývka, Filip, Sokołowski, Marek
Twin-width is a structural width parameter introduced by Bonnet, Kim, Thomass\'e and Watrigant [FOCS 2020]. Very briefly, its essence is a gradual reduction (a contraction sequence) of the given graph down to a single vertex while maintaining limited
Externí odkaz:
http://arxiv.org/abs/2307.01732
Let $d$ be a positive integer. For a finite set $X \subseteq \mathbb{R}^d$, we define its integer cone as the set $\mathsf{IntCone}(X) := \{ \sum_{x \in X} \lambda_x \cdot x \mid \lambda_x \in \mathbb{Z}_{\geq 0} \} \subseteq \mathbb{R}^d$. Goemans a
Externí odkaz:
http://arxiv.org/abs/2307.00406
We present a data structure that for a dynamic graph $G$ that is updated by edge insertions and deletions, maintains a tree decomposition of $G$ of width at most $6k+5$ under the promise that the treewidth of $G$ never grows above $k$. The amortized
Externí odkaz:
http://arxiv.org/abs/2304.01744
Autor:
Kaiser Alicja, Sokołowski Marek
Publikováno v:
Biomedical Human Kinetics, Vol 3, Iss 2011, Pp 96-100 (2011)
Externí odkaz:
https://doaj.org/article/072a724935624b22a71ac4cd17355565