Zobrazeno 1 - 10
of 37
pro vyhledávání: '"Chuan-Min Lee"'
Autor:
Chuan-Min Lee
Publikováno v:
Algorithms, Vol 17, Iss 8, p 359 (2024)
The clique transversal problem is a critical concept in graph theory, focused on identifying a minimum subset of vertices that intersects all maximal cliques in a graph. This problem and its variations—such as the k-fold clique, {k}-clique, minus c
Externí odkaz:
https://doaj.org/article/0acbb51e77454b7ea113abbd6ef93e0a
Autor:
Chuan-Min Lee
Publikováno v:
Axioms, Vol 13, Iss 6, p 382 (2024)
This paper explores the computational challenges of clique transversal problems in d-degenerate graphs, which are commonly encountered across theoretical computer science and various network applications. We examine d-degenerate graphs to highlight t
Externí odkaz:
https://doaj.org/article/7e035e0d37dd481ca9179fc0cd8c7b1b
Autor:
Chuan-Min Lee
Publikováno v:
Mathematics, Vol 11, Iss 15, p 3325 (2023)
The clique transversal problem and its variants have garnered significant attention in the last two decades due to their practical applications in communication networks, social-network theory and transceiver placement for cellular telephones. While
Externí odkaz:
https://doaj.org/article/1da07492754d48138e9d6709c65d1489
Autor:
Hsing-Han Liu, Chuan-Min Lee
Publikováno v:
EURASIP Journal on Image and Video Processing, Vol 2019, Iss 1, Pp 1-15 (2019)
Abstract In this study, an improved reversible image steganography method based on pixel value ordering (PVO) is proposed to improve the steganographic capacity. Before the steganography process, three continuous and neighboring pixels are regarded a
Externí odkaz:
https://doaj.org/article/aaeda1f6840f462d9afdac36a192fdfa
Autor:
Chuan-Min Lee
Publikováno v:
Symmetry, Vol 14, Iss 4, p 676 (2022)
With the rapid growth in the penetration rate of mobile devices and the surge in demand for mobile data services, small cells and mobile backhaul networks have become the critical focus of next-generation mobile network development. Backhaul requirem
Externí odkaz:
https://doaj.org/article/07628396995d45e7a33f14c13df1b13c
Autor:
Chuan-Min Lee
Publikováno v:
Algorithms, Vol 14, Iss 1, p 22 (2021)
This paper studies the maximum-clique independence problem and some variations of the clique transversal problem such as the {k}-clique, maximum-clique, minus clique, signed clique, and k-fold clique transversal problems from algorithmic aspects for
Externí odkaz:
https://doaj.org/article/1dd5f1e5b2f843e3a50c914006cdd250
Autor:
Chuan-Min Lee, 李權珉
106
This study mainly discusses the modification and synthesis of engineering plastic Poly(phenyl oxide) PPO. Generally, Poly(phenyl oxide) PPO is difficult to process due to high molecular weight during preparation. The PPO used in this article
This study mainly discusses the modification and synthesis of engineering plastic Poly(phenyl oxide) PPO. Generally, Poly(phenyl oxide) PPO is difficult to process due to high molecular weight during preparation. The PPO used in this article
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/278z9z
Autor:
Chuan-Min Lee, 李傳敏
99
Background and Objective: Extracorporeal Membrane Oxygenation, also called ECMO, as the most important life-sustaining treatment is widely used in Taiwan. Due to the advance of medical technology and the accumulation of clinical experiences u
Background and Objective: Extracorporeal Membrane Oxygenation, also called ECMO, as the most important life-sustaining treatment is widely used in Taiwan. Due to the advance of medical technology and the accumulation of clinical experiences u
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/52824605000203735020
Autor:
Chuan-Min Lee, 李權明
94
Graphs and graph algorithms are pervasive and fundamental in computer science. There are many interesting computational and practical problems defined in terms of graphs. The domination problem is one of the most important graph optimization
Graphs and graph algorithms are pervasive and fundamental in computer science. There are many interesting computational and practical problems defined in terms of graphs. The domination problem is one of the most important graph optimization
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/67867661979781529065
Autor:
Chuan-Min Lee, 李權明
88
A feedback vertex set F of a graph G=(V,E) is a subset of V such that the grpah induced by V\F has no cycles. If each vertex v of G is associated with a real number w(v), called the weight of vertex v, then G is a weighted graph.The weighted
A feedback vertex set F of a graph G=(V,E) is a subset of V such that the grpah induced by V\F has no cycles. If each vertex v of G is associated with a real number w(v), called the weight of vertex v, then G is a weighted graph.The weighted
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/54796525875927691416