Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Tanvir Kaykobad"'
Publikováno v:
Journal of Intelligent & Robotic Systems. 107
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4ea3a8b59cd2d658c68226e181295187
https://doi.org/10.1007/s10846-023-01825-2
https://doi.org/10.1007/s10846-023-01825-2
Autor:
Palash Ranjan Roy, Md. Noushin Islam, Labiba Tasfiya Jeba, Md. Adnanul Haq, Iffat Afsara Prome, Mohammad Kaykobad, Tanvir Kaykobad
Publikováno v:
2022 International Conference on Innovations in Science, Engineering and Technology (ICISET).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b7afde9ad122b36238d60decc0e2079f
https://doi.org/10.1109/iciset54810.2022.9775821
https://doi.org/10.1109/iciset54810.2022.9775821
Autor:
Jean-Lou De Carufel, Tanvir Kaykobad
Publikováno v:
Information Processing Letters. 170:106120
We study the number of simultaneous diagonal flips required to transform any triangulation into any other. The best known algorithm requires no more than 4 × ( 2 log 54 53 + 2 log 6 5 ) log n + 2 ≈ 327.1 log n simultaneous flips. T
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::41a4f7b4a6759f388ec059e94d8abe27
https://doi.org/10.1016/j.ipl.2021.106120
https://doi.org/10.1016/j.ipl.2021.106120
Publikováno v:
Electronic Notes in Discrete Mathematics. 44:307-312
In this paper, we present Dirac-type sufficient conditions for a bipartite graph to possess a Hamiltonian path. We also define a seemingly new family of bipartite graphs, which we call the Z graphs. We show that our sufficient condition can also ensu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::55ce7e9acecea0e3d80d53225eaa598f
https://doi.org/10.1016/j.endm.2013.10.048
https://doi.org/10.1016/j.endm.2013.10.048