Zobrazeno 1 - 10
of 585
pro vyhledávání: '"Parametrized complexity"'
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.
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.
Autor:
Cornelsen, Sabine, Da Lozzo, Giordano, Grilli, Luca, Gupta, Siddharth, Kratochvíl, Jan, Wolff, Alexander
Given a straight-line drawing of a graph, a segment is a maximal set of edges that form a line segment. Given a planar graph $G$, the segment number of $G$ is the minimum number of segments that can be achieved by any planar straight-line drawing of
Externí odkaz:
http://arxiv.org/abs/2308.15416
Autor:
Ardeshir-Larijani, Ebrahim
Motivated by recent progress in quantum technologies and in particular quantum software, research and industrial communities have been trying to discover new applications of quantum algorithms such as quantum optimization and machine learning. Regard
Externí odkaz:
http://arxiv.org/abs/2112.11686
Autor:
Elkin, Yury, Kurlin, Vitaliy
This paper studies the important problem of finding all $k$-nearest neighbors to points of a query set $Q$ in another reference set $R$ within any metric space. Our previous work defined compressed cover trees and corrected the key arguments in sever
Externí odkaz:
http://arxiv.org/abs/2201.06553
Publikováno v:
27th Annual European Symposium on Algorithms (ESA 2019), Leibniz International Proceedings in Informatics (LIPIcs) vol. 144, 2019, p. 13:1-15
Deciding whether two simplicial complexes are homotopy equivalent is a fundamental problem in topology, which is famously undecidable. There exists a combinatorial refinement of this concept, called simple-homotopy equivalence: two simplicial complex
Externí odkaz:
http://arxiv.org/abs/1910.09228
Autor:
Subramani, K., Wojciechowski, P.
Publikováno v:
In Theoretical Computer Science 3 September 2021 883:1-18
Autor:
Stefanou, Anastasios
Inspired by the interval decomposition of persistence modules and the extended Newick format of phylogenetic networks, we show that, inside the larger category of \textit{ordered Reeb graphs}, every Reeb graph with $n$ leaves and first Betti number $
Externí odkaz:
http://arxiv.org/abs/1902.05855
Autor:
Cattanéo, David, Perdrix, Simon
Publikováno v:
Fundamentals of Computation Theory (FCT'13), LNCS vol 8070 pp 107-120, 2013
Given a graph $G=(V,E)$, a subset $B\subseteq V$ of vertices is a weak odd dominated (WOD) set if there exists $D \subseteq V {\setminus} B$ such that every vertex in $B$ has an odd number of neighbours in $D$. $\kappa(G)$ denotes the size of the lar
Externí odkaz:
http://arxiv.org/abs/1206.4081
Autor:
Stefanou, Anastasios
Publikováno v:
Journal of Applied and Computational Topology; 20240101, Issue: Preprints p1-28, 28p