Zobrazeno 1 - 10
of 90
pro vyhledávání: '"Ladislav Stacho"'
Publikováno v:
Journal of Computational Geometry, Vol 7, Iss 2 (2015)
We show that in the hierarchical tile assembly model, if there is a producible assembly that overlaps a nontrivial translation of itself consistently (i.e., the pattern of tile types in the overlap region is identical in both translations), then arbi
Externí odkaz:
https://doaj.org/article/75d93c8c949d45f5a816166ef1ba229e
Publikováno v:
Graphs and Combinatorics. 38
Given a graph $G$ and a family $\mathcal{G} = \{G_1,\ldots,G_n\}$ of subgraphs of $G$, a transversal of $\mathcal{G}$ is a pair $(T,\phi)$ such that $T \subseteq E(G)$ and $\phi: T \rightarrow [n]$ is a bijection satisfying $e \in G_{\phi(e)}$ for ea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::09c119d1ea4ade48f2341bef5b1afab3
https://doi.org/10.1007/s00373-022-02574-z
https://doi.org/10.1007/s00373-022-02574-z
Let $\Lambda(T)$ denote the set of leaves in a tree $T$. One natural problem is to look for a spanning tree $T$ of a given graph $G$ such that $\Lambda(T)$ is as large as possible. This problem is called maximum leaf number, and it is a well-known NP
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3af74fe0d31d8a7f885cde02b57ae6ea
We establish a lower bound for the cop number of graphs of high girth in terms of the minimum degree, and more generally, in terms of a certain growth condition. We show, in particular, that the cop number of any graph with girth $g$ and minimum degr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::372f8fafeb6b5672a3d0424364c8f1de
http://arxiv.org/abs/2005.10849
http://arxiv.org/abs/2005.10849
For a given $\varepsilon > 0$, we say that a graph $G$ is $\varepsilon$-flexibly $k$-choosable if the following holds: for any assignment $L$ of color lists of size $k$ on $V(G)$, if a preferred color from a list is requested at any set $R$ of vertic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9f9d583381ddc783d99ac0ec7e0cc16f
Autor:
Ladislav Stacho, Masood Masjoody
It is known that the class of all graphs not containing a graph $H$ as an induced subgraph is cop-bounded if and only if $H$ is a forest whose every component is a path. In this study, we characterize all sets $\mathscr{H}$ of graphs with some $k\in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f5c1c0d159d1fe152d1eb8086e3292b9
Publikováno v:
Algorithmica
Algorithmica, Springer Verlag, 2017, 79 (3), pp.835--856. ⟨10.1007/s00453-016-0196-x⟩
Algorithmica, 2017, 79 (3), pp.835--856. ⟨10.1007/s00453-016-0196-x⟩
Algorithmica, Springer Verlag, 2017, 79 (3), pp.835--856. ⟨10.1007/s00453-016-0196-x⟩
Algorithmica, 2017, 79 (3), pp.835--856. ⟨10.1007/s00453-016-0196-x⟩
We consider the Combinatorial RNA Design problem, a minimal instance of RNA design where one must produce an RNA sequence that adopts a given secondary structure as its minimal free-energy structure. We consider two free-energy models where the contr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ae95bd1a850c687ea720f03aa85b67c1
https://hal.inria.fr/hal-01285499
https://hal.inria.fr/hal-01285499
Publikováno v:
Combinatorial Optimization and Applications ISBN: 9783319711461
COCOA (2)
COCOA (2)
Hamiltonicity of graphs possessing symmetry has been a popular subject of research, with focus on vertex-transitive graphs, and in particular on Cayley graphs. In this paper, we consider the Hamiltonicity of another class of graphs with symmetry, nam
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ee4dfb9829b945290dc1ed1abf7d5b6b
https://doi.org/10.1007/978-3-319-71147-8_18
https://doi.org/10.1007/978-3-319-71147-8_18
Autor:
Jaroslav Opatrny, Danny Krizanc, Evangelos Kranakis, Sunil M. Shende, Ladislav Stacho, Manuel Lafond, Ján Maňuch, Lata Narayanan, Stefan Dobrev
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319575858
CIAC
CIAC
Assume n wireless mobile sensors are initially dispersed in an ad hoc manner in a rectangular region. They are required to move to final locations so that they can detect any intruder crossing the region in a direction parallel to the sides of the re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7009b7d9ed8c8a6fb084f22b4d5c44a2
https://doi.org/10.1007/978-3-319-57586-5_17
https://doi.org/10.1007/978-3-319-57586-5_17
Autor:
Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Ján Maňuch, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho
Assume n wireless mobile sensors are initially dispersed in an ad hoc manner in a rectangular region. They are required to move to final locations so that they can detect any intruder crossing the region in a direction parallel to the sides of the re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6925700b71965dfa7c964b5a0a3b3eda