Zobrazeno 1 - 10
of 41
pro vyhledávání: '"Yehong Shao"'
Publikováno v:
IEEE Access, Vol 9, Pp 81147-81160 (2021)
Object detection is widely used in robot navigation, intelligent security and industrial detection, but it is rarely used in water conservancy industry. In the aspect of river and lake health management, it is important to clean out the floating obje
Externí odkaz:
https://doaj.org/article/6d25abdbe6794287bdc93bd546db7d5d
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 24, no. 1, Iss Graph Theory (2022)
For a non-negative integer $s\le |V(G)|-3$, a graph $G$ is $s$-Hamiltonian if the removal of any $k\le s$ vertices results in a Hamiltonian graph. Given a connected simple graph $G$ that is not isomorphic to a path, a cycle, or a $K_{1,3}$, let $\del
Externí odkaz:
https://doaj.org/article/bf5efe61969e400eba9afb2ee09903c8
Publikováno v:
Remote Sensing, Vol 13, Iss 13, p 2594 (2021)
The tidal flat is long and narrow area along rivers and coasts with high sediment content, so there is little feature difference between the waterbody and the background, and the boundary of the waterbody is blurry. The existing waterbody extraction
Externí odkaz:
https://doaj.org/article/19071c6ff4fc45f6b4aa321c5006be08
Publikováno v:
Sensors, Vol 20, Iss 5, p 1465 (2020)
In this paper, we consider building extraction from high spatial resolution remote sensing images. At present, most building extraction methods are based on artificial features. However, the diversity and complexity of buildings mean that building ex
Externí odkaz:
https://doaj.org/article/3732d10afcdd4f5e9c2adbb5ce6b8828
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AE,..., Iss Proceedings (2005)
Thomassen conjectured that every $4$-connected line graph is hamiltonian. A vertex cut $X$ of $G$ is essential if $G-X$ has at least two nontrivial components. We prove that every $3$-connected, essentially $11$-connected line graph is hamiltonian. U
Externí odkaz:
https://doaj.org/article/7ca86edf3b374192ad4b5c7225e1c4ac
Publikováno v:
IEEE Access, Vol 9, Pp 81147-81160 (2021)
Object detection is widely used in robot navigation, intelligent security and industrial detection, but it is rarely used in water conservancy industry. In the aspect of river and lake health management, it is important to clean out the floating obje
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fe894f945a1e0839305f520013cb7463
https://ieeexplore.ieee.org/document/9445052/
https://ieeexplore.ieee.org/document/9445052/
Autor:
Yehong Shao
Publikováno v:
Electronic Journal of Graph Theory and Applications. 10:565
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::86c8ffc6e6f99374b0eba6e57a89f106
https://doi.org/10.5614/ejgta.2022.10.2.16
https://doi.org/10.5614/ejgta.2022.10.2.16
Publikováno v:
Remote Sensing, Vol 13, Iss 2594, p 2594 (2021)
Remote Sensing
Volume 13
Issue 13
Pages: 2594
Remote Sensing
Volume 13
Issue 13
Pages: 2594
The tidal flat is long and narrow area along rivers and coasts with high sediment content, so there is little feature difference between the waterbody and the background, and the boundary of the waterbody is blurry. The existing waterbody extraction
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e7c443cd977d7c6b2f3d7ade53bfab82
https://www.mdpi.com/2072-4292/13/13/2594
https://www.mdpi.com/2072-4292/13/13/2594
Autor:
Yehong Shao
Publikováno v:
Electronic Journal of Graph Theory & Applications; 2022, Vol. 10 Issue 2, p565-573, 9p
Autor:
Yehong Shao
Publikováno v:
Discrete Mathematics. 341:3441-3446
Let G be a graph and L ( G ) be its line graph. In 1969, Chartrand and Stewart proved that κ ′ ( L ( G ) ) ≥ 2 κ ′ ( G ) − 2 , where κ ′ ( G ) and κ ′ ( L ( G ) ) denote the edge connectivity of G and L ( G ) respectively. We show a s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f7048a15661247a649c576957211978d
https://doi.org/10.1016/j.disc.2018.08.029
https://doi.org/10.1016/j.disc.2018.08.029