Zobrazeno 1 - 7
of 7
pro vyhledávání: '"05C38, 68R10"'
Autor:
Yuster, Raphael
For every fixed $k \ge 4$, it is proved that if an $n$-vertex directed graph has at most $t$ pairwise arc-disjoint directed $k$-cycles, then there exists a set of at most $\frac{2}{3}kt+ o(n^2)$ arcs that meets all directed $k$-cycles and that the se
Externí odkaz:
http://arxiv.org/abs/2312.01901
Autor:
Lü, Huazhong, Wu, Tingzeng
The balanced hypercube $BH_n$, a variant of the hypercube, was proposed as a desired interconnection network topology. It is known that $BH_n$ is bipartite. Assume that $S=\{s_1,s_2,\cdots,s_{2n-2}\}$ and $T=\{t_1,t_2,\cdots,t_{2n-2}\}$ are any two s
Externí odkaz:
http://arxiv.org/abs/1912.05443
Publikováno v:
Theoretical Computer Science, Volume 775, 5 July 2019, Pages 16-25
We investigate the terminal-pairability problem in the case when the base graph is a complete bipartite graph, and the demand graph is a (not necessarily bipartite) multigraph on the same vertex set. In computer science, this problem is known as the
Externí odkaz:
http://arxiv.org/abs/1705.02124
Autor:
Bakalarski, Sławomir, Zygadło, Jakub
Publikováno v:
Schedae Informaticae, vol. 24 (2015), pp. 230-242
A subset $S$ of vertices of a graph $G=(V,E)$ is called a $k$-path vertex cover if every path on $k$ vertices in $G$ contains at least one vertex from $S$. Denote by $\psi_k(G)$ the minimum cardinality of a $k$-path vertex cover in $G$ and form a seq
Externí odkaz:
http://arxiv.org/abs/1511.05384
Publikováno v:
Ann. Comb. 8 (2005) 425-439
An important problem in the theory of finite dynamical systems is to link the structure of a system with its dynamics. This paper contains such a link for a family of nonlinear systems over the field with two elements. For systems that can be describ
Externí odkaz:
http://arxiv.org/abs/math/0403166
Publikováno v:
Theoretical Computer Science. 775:16-25
We investigate the terminal-pairability problem in the case when the base graph is a complete bipartite graph, and the demand graph is a (not necessarily bipartite) multigraph on the same vertex set. In computer science, this problem is known as the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b94b84dfac0b1667742aa75b940431a1
https://doi.org/10.1016/j.tcs.2018.12.007
https://doi.org/10.1016/j.tcs.2018.12.007
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.