Zobrazeno 1 - 10
of 47
pro vyhledávání: '"Mathematics of computing ��� Combinatorial algorithms"'
Publikováno v:
Journal of Combinatorial Theory, Series B. 160:163-205
The \emph{central levels problem} asserts that the subgraph of the $(2m+1)$-dimensional hypercube induced by all bitstrings with at least $m+1-\ell$ many 1s and at most $m+\ell$ many 1s, i.e., the vertices in the middle $2\ell$ levels, has a Hamilton
Publikováno v:
Proceedings of STACS 2022
Given integers k ��� 2 and a_1,���,a_k ��� 1, let a: = (a_1,���,a_k) and n: = a_1+���+a_k. An a-multiset permutation is a string of length n that contains exactly a_i symbols i for each i = 1,���,k. In this work we
We consider the problem of finding an incremental solution to a cardinality-constrained maximization problem that not only captures the solution for a fixed cardinality, but also describes how to gradually grow the solution as the cardinality bound i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6cf643c80315063a7123ced626bfad2c
http://arxiv.org/abs/2305.01310
http://arxiv.org/abs/2305.01310
This work describes the winning implementation of the CG:SHOP 2023 Challenge. The topic of the Challenge was the convex cover problem: given a polygon P (with holes), find a minimum-cardinality set of convex polygons whose union equals P. We use a th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6260b06712ef3133f6c96651c1c5e477
Autor:
Wagner, Hubert
We focus on efficient computations of topological descriptors for voxel data. This type of data includes 2D greyscale images, 3D medical scans, but also higher-dimensional scalar fields arising from physical simulations. In recent years we have seen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d224fc4cbe8fa5a2dfdc80fb6c1578b0
Autor:
Aichinger, Erhard, Grünbacher, Simon
We consider finite algebraic structures and ask whether every solution of a given system of equations satisfies some other equation. This can be formulated as checking the validity of certain first order formulae called quasi-identities. Checking the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ac0fa27a220847a4d2d78bfc5ab80799
Autor:
Haviv, Ishay
A subset of $[n] = \{1,2,\ldots,n\}$ is called stable if it forms an independent set in the cycle on the vertex set $[n]$. In 1978, Schrijver proved via a topological argument that for all integers $n$ and $k$ with $n \geq 2k$, the family of stable $
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5f79b892d6ed93ec09bc2ea60795f186
Autor:
Haviv, Ishay
The Schrijver graph $S(n,k)$ is defined for integers $n$ and $k$ with $n \geq 2k$ as the graph whose vertices are all the $k$-subsets of $\{1,2,\ldots,n\}$ that do not include two consecutive elements modulo $n$, where two such sets are adjacent if t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::750cdd87c8ea3ce10f3f7d0884622bde
http://arxiv.org/abs/2204.09009
http://arxiv.org/abs/2204.09009
Autor:
Haviv, Ishay
The Kneser graph $K(n,k)$ is defined for integers $n$ and $k$ with $n \geq 2k$ as the graph whose vertices are all the $k$-subsets of $\{1,2,\ldots,n\}$ where two such sets are adjacent if they are disjoint. A classical result of Lov\'asz asserts tha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::559f265c4661c3216deee47dd5b76fd0
http://arxiv.org/abs/2204.06761
http://arxiv.org/abs/2204.06761
Persistent homology is perhaps the most popular and useful tool offered by topological data analysis - with point-cloud data being the most common setup. Its older cousin, the Euler characteristic curve (ECC) is less expressive - but far easier to co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3b577f5a9f80f4bee21ef68e6287ba29
http://arxiv.org/abs/2203.09087
http://arxiv.org/abs/2203.09087