Chuan-Min Lee
Ming Chuan University, Applied Artificial Intelligence, Faculty Member
- Ming Chuan University, Computer and Communication Engineering, Faculty Memberadd
- Dr. Chuan-Min Lee, also known as Jones Chuan-Min Lee, was born on June 25, 1976. He is a full-time professor in the D... moreDr. Chuan-Min Lee, also known as Jones Chuan-Min Lee, was born on June 25, 1976. He is a full-time professor in the Department of Applied Artificial Intelligence at Ming Chuan University. He completed his graduate studies in the Department of Computer Science and Information Engineering at Chung Cheng University.
Chuan-Min Lee has strong expertise in algorithm design and analysis, graph theory and combinatorial optimization, and decision-making and analysis in social networks. With extensive teaching experience in computer science, he has become a respected figure in the field. Chuan-Min Lee holds several certifications that reflect his proficiency in electronic data analysis, big data analytics, and creative app programming. These include the Taiwan Enterprise Electronic Data Analyst, Artificial Intelligence Big Data Analyst, Creative App Programming Talent Certification, and CEAC National Information Computer Education Certification. He received his Bachelor's degree in Computer Science from I-Shou University (ISU) in 1998 and pursued his master's and doctoral degrees at Chung Cheng University. He took on various roles in his academic journey, including part-time lecturer, intern engineer, course assistant, and part-time lecturer at the Department of Computer Science and Information Engineering at Chung Cheng University. He also worked as a research assistant for the National Science Council.
Chuan-Min Lee obtained his Ph.D. in Computer Science from Chung Cheng University in 2006. Following his academic achievements, he served in the Second Platoon of the Service Battalion at the Command Headquarters of the Ministry of National Defense, where he was honored with the Outstanding Soldier Commemorative Medal.
After completing his military service, Chuan-Min Lee embarked on an educational career. In 2007, he joined Toko College of Technology and Management as an assistant professor and became the Department of Animation and Game Design director. He played a crucial role as the first director of the department's master's program. In February 2008, he transitioned to Ming Chuan University, assuming the position of assistant professor in the Department of Computer and Communication Engineering. Recognizing his contributions and expertise, he was promoted to associate professor in August 2012. From February 2013, he served as the acting director of the Department of Computer and Communication Engineering for one year.
Furthermore, Chuan-Min Lee actively engages in projects encompassing cultural preservation and meeting the modern era's evolving demands. Notably, he actively participated in compiling the "Essential Usage Dictionary" published by Taiwan's Sanmin Books. The dictionary received recognition and was recommended as an excellent extracurricular reading material for primary and secondary school students by the Ministry of Culture in 2014.
Chuan-Min Lee has received numerous prestigious awards and honors, including the Senior Excellent Teacher Award from the Ministry of Education, the Effective Supervision Award for the National Science Council's College Student Research Projects, the Effective Supervision Award for the Ministry of Science and Technology's College Student Research Projects, the Teaching Excellence Award, the Excellent Mentor Award, the Excellent Club Advisor Award, the Special Outstanding Talent Award, the Research Project Incentive Award from the National Science Council, the Research Project Incentive Award from the Ministry of Science and Technology, the Subsidy for Information Software Talent Cultivation and Promotion Program from the Ministry of Education, the Academic Research Paper Award, the Academic Research Achievement Award, the Model Teacher Award from the Private Education Association, and his promotion to the professorship in August 2020.
Chuan-Min Lee is a member of professional organizations, including the American Mathematical Society (AMS), the Association for Computing Machinery (ACM), and the Association for Algorithms and Computational Theory (AACT). As a member of these organizations, Chuan-Min Lee continues contributing to the research community, engaging in collaborations, and sharing knowledge.edit
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.... more
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 requirements within current wireless networks are almost asymmetrical, with most traffic flowing from the core to the handset, but 5G networks will require more symmetrical backhaul capability. The deployment of small cells and the placement of transceivers for cellular phones are crucial in trading off the symmetric backhaul capability and cost-effectiveness. The deployment of small cells is related to the placement of transceivers for cellular phones. Chang, Kloks, and Lee transformed the placement problem into the maximum-clique transversal problem on graphs. From the theoretical point of view, our paper considers the parameterized complexity of variations of the maximum-clique transversal problem for split graphs, doubly chordal graphs, plan...
Research Interests:
Research Interests:
Remarks on the complexity of signed k-independence on graphs
Research Interests:
Let Y be a subset of real numbers. A Y-dominating function of a graph G = (V, E) is a function f: V → Y such that ∑ u∈NG[v] f(u) ≥ 1 for all vertices v ∈ V, where NG[v] = {v} ∪ {u|(u, v) ∈ E}. Let f(S) = ∑ u∈S f(u) for any subset S of V... more
Let Y be a subset of real numbers. A Y-dominating function of a graph G = (V, E) is a function f: V → Y such that ∑ u∈NG[v] f(u) ≥ 1 for all vertices v ∈ V, where NG[v] = {v} ∪ {u|(u, v) ∈ E}. Let f(S) = ∑ u∈S f(u) for any subset S of V and let f(V) be the weight of f. The Y-domination problem is to find a Y-dominating function of minimum weight for a graph. In this paper, we study the variations of Y-domination such as {k}-domination, k-tuple domination, signed domination, and minus domination for some classes of graphs. We present a unified approach to these four domination problems on strongly chordal graphs. Notice that trees, block graphs, interval graphs, and directed path graphs are subclasses of strongly chordal graphs. This paper also gives complexity results for these four domination problems on doubly chordal graphs, dually chordal graphs, chordal bipartite graphs, and planar graphs. 1
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... more
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 k-trees, suns, planar graphs, doubly chordal graphs, clique perfect graphs, total graphs, split graphs, line graphs, and dually chordal graphs. We give equations to compute the {k}-clique, minus clique, signed clique, and k-fold clique transversal numbers for suns, and show that the {k}-clique transversal problem is polynomial-time solvable for graphs whose clique transversal numbers equal their clique independence numbers. We also show the relationship between the signed and generalization clique problems and present NP-completeness results for the considered problems on k-trees with unbounded k, planar graphs, doubly chordal graphs, total graphs, split graphs, line graphs, and dually chordal graphs.
Research Interests:
The total k-domatic partition problem is to partition the vertices of a graph into k pairwise disjoint total dominating sets. In this paper, we prove that the 4-domatic partition problem is NP-complete for planar graphs of bounded maximum... more
The total k-domatic partition problem is to partition the vertices of a graph into k pairwise disjoint total dominating sets. In this paper, we prove that the 4-domatic partition problem is NP-complete for planar graphs of bounded maximum degree. We use this NP-completeness result to show that the total 4-domatic partition problem is also NP-complete for planar graphs of bounded maximum degree. We also show that the total k-domatic partition problem is linear-time solvable for any bipartite distance-hereditary graph by showing how to compute a weak elimination ordering of the graph in linear time. The linear-time algorithm for computing a weak elimination ordering of a bipartite distance-hereditary graph can lead to improvement on the complexity of several graph problems or alternative solutions to the problems such as signed total domination, minus total domination, k-tuple total domination, and total \(\{k\}\)-domination problems.
Research Interests:
In this paper we study the edge-thickness and the clique-thickness of a graph. The edge-thickness of a graph is defined as the thickness of the family of edges. The clique-thickness of a graph is defined as the thickness of the family of... more
In this paper we study the edge-thickness and the clique-thickness of a graph. The edge-thickness of a graph is defined as the thickness of the family of edges. The clique-thickness of a graph is defined as the thickness of the family of maximal cliques. Edges and maximal cliques of a graph are both considered as a collection of subsets of the vertex set. On one hand, we introduce a new parameter called stickiness. We show the relation between stickiness and edge-thickness, and show how the stickiness of a graph can be computed in a more efficient way. On the other hand, we show that the clique-thickness is equal to the reciprocal of the fractional stability number. For graphs having the property that the clique cover number is equal to the independence number it follows that the clique-thickness is equal to the reciprocal of the independence number, and in this case it is computable in polynomial time.
Research Interests:
In this paper, we propose two linear-time algorithms. One is for computing a weak elimination ordering of a bipartite distance-hereditary graph, and the other one is an alternative algorithm to solve the total R-domination problem for any... more
In this paper, we propose two linear-time algorithms. One is for computing a weak elimination ordering of a bipartite distance-hereditary graph, and the other one is an alternative algorithm to solve the total R-domination problem for any chordal bipartite graph with a weak elimination ordering. Our two linear-time algorithms lead to a unified approach to several variations of total domination problems for bipartite distance-hereditary graphs. We also show that tthe total 3-domatic partition problem is NP-complete for planar graphs of maximum degree 9 and planar bipartite graphs of maximum degree 12, and show that the 4-domatic partition problem for planar graphs of maximum degree d is polynomial-time reducible to the total 4-domatic partition problem for planar graphs of maximum degree d + 1.
Research Interests:
Research Interests:
Motivated by the concept of reverse signed domination, we introduce the reverse minus domination problem on graphs, and study the reverse minus and signed domination problems from the algorithmic point of view. In this paper, we show that... more
Motivated by the concept of reverse signed domination, we introduce the reverse minus domination problem on graphs, and study the reverse minus and signed domination problems from the algorithmic point of view. In this paper, we show that both the reverse minus and signed domination problems are polynomial-time solvable for strongly chordal graphs and distance-hereditary graphs, and are linear-time solvable for trees. For chordal graphs and bipartite planar graphs, however, we show that the decision problem corresponding to the reverse minus domination problem is NP-complete. For doubly chordal graphs and bipartite planar graphs, we show that the decision problem corresponding to the reverse signed domination problem is NP-complete. Furthermore, we show that even when restricted to bipartite planar graphs or doubly chordal graphs, the reverse signed domination problem is not fixed parameter tractable.
Research Interests:
Research Interests:
Amaximum-clique transversal setof a graphGis a subset of vertices intersecting all maximum cliques ofG. Themaximum-clique transversal set problemis to find a maximum-clique transversal set ofGof minimum cardinality. Motivated by the... more
Amaximum-clique transversal setof a graphGis a subset of vertices intersecting all maximum cliques ofG. Themaximum-clique transversal set problemis to find a maximum-clique transversal set ofGof minimum cardinality. Motivated by the placement of transmitters for cellular telephones, Chang, Kloks, and Lee introduced the concept of maximum-clique transversal sets on graphs in 2001. In this paper, we study theweighted versionof the maximum-clique transversal set problem for split graphs, balanced graphs, strongly chordal graph, Helly circular-arc graphs, comparability graphs, distance-hereditary graphs, and graphs of bounded treewidth.
Research Interests:
The literature is extensive on algorithms and complexity results for the problems of dominating or covering vertices or edges by other vertices or edges. For any one of these dominating or covering problems, we observe that no matter what... more
The literature is extensive on algorithms and complexity results for the problems of dominating or covering vertices or edges by other vertices or edges. For any one of these dominating or covering problems, we observe that no matter what the definition or concept is, it is almost always solvable in linear time for trees. In this paper, we attempt to bring together a number of recent ideas in the study of domination-related problems into a single framework for trees. To do so, we introduce the notion of P-mixed domination and present a linear-time algorithm to solve the P-mixed domination problem in trees. Our algorithm gives a unified approach to mixed domination and various dominating and covering problems for trees.
Research Interests:
This paper is motivated by the concept of the signed k-independence problem and dedicated to the complexity of the problem on graphs. We show that the problem is linear-time solvable for any strongly chordal graph with a strong... more
This paper is motivated by the concept of the signed k-independence problem and dedicated to the complexity of the problem on graphs. We show that the problem is linear-time solvable for any strongly chordal graph with a strong elimination ordering and polynomial-time solvable for distance-hereditary graphs. For any fixed positive integer k ≥ 1, we show that the signed k-independence problem on chordal graphs and bipartite planar graphs is NP-complete. Furthermore, we show that even when restricted to chordal graphs or bipartite planar graphs, the signed k-independence problem, parameterized by a positive integer k and weight κ, is not fixed parameter tractable.
Research Interests:
Motivated by the concept of reverse signed domination, we introduce the reverse minus domination problem on graphs and study the problem from the algorithmic point of view. For strongly chordal graphs and distance-hereditary graphs, we... more
Motivated by the concept of reverse signed domination, we introduce the reverse minus domination problem on graphs and study the problem from the algorithmic point of view. For strongly chordal graphs and distance-hereditary graphs, we show that the reverse minus domination problem can be solved in polynomial time. We also show that the problem is linear-time solvable for trees. For chordal graphs and bipartite planar graphs, however, we show that the decision problem corresponding to the reverse minus domination problem is NP-complete.
Research Interests:
In this paper we study the signed and minus total domination problems for two subclasses of bipartite graphs: biconvex bipartite graphs and planar bipartite graphs. We present a unified method to solve the signed and minus total... more
In this paper we study the signed and minus total domination problems for two subclasses of bipartite graphs: biconvex bipartite graphs and planar bipartite graphs. We present a unified method to solve the signed and minus total domination problems for biconvex bipartite graphs in O(n+m) time. We also prove that the decision problem corresponding to the signed (or minus, respectively) total domination problem is NP-complete for planar bipartite graphs of maximum degree 3 (maximum degree 4, respectively).
Research Interests:
In this paper, we study the total domatic partition problem for bipartite graphs, circular-arc graphs, and graphs with balanced adjacency matrices. We show that the total domatic partition problem is NP-complete for bipartite graphs and... more
In this paper, we study the total domatic partition problem for bipartite graphs, circular-arc graphs, and graphs with balanced adjacency matrices. We show that the total domatic partition problem is NP-complete for bipartite graphs and circular-arc graphs, and show that the total domatic partition problem is polynomial-time solvable for graphs with balanced adjacency matrices. Furthermore, we show that the total domatic partition problem is linear-time solvable for chordal bipartite graphs.
We present new fixed parameter algorithms for the face cover problem on plane graphs. We show that if a plane graph has a face cover with at most k faces then its treewidth is bounded by O(Ö</font... more
We present new fixed parameter algorithms for the face cover problem on plane graphs. We show that if a plane graph has a face cover with at most k faces then its treewidth is bounded by O(Ö</font >k ) O(\sqrt k ) . An approximate tree decomposition can be obtained in linear time, and this is used to find an
Research Interests:
Research Interests:
The G\mathcal{G}-width of a class of graphs G\mathcal{G} is defined as follows. A graph G has G\mathcal{G}-width k if there are k independent sets ℕ1,...,ℕ k in G such that G can be embedded into a graph H Î</font... more
The G\mathcal{G}-width of a class of graphs G\mathcal{G} is defined as follows. A graph G has G\mathcal{G}-width k if there are k independent sets ℕ1,...,ℕ k in G such that G can be embedded into a graph H Î</font > GH \in \mathcal{G} with the property that for every edge e in H which is not an edge in G, there exists an i such that both endpoints of e are in ℕ i . For the class \mathfrakT\mspace-</font >1.5mu\mathfrakP\mathfrak{T}\mspace{-1.5mu}\mathfrak{P} of trivially-perfect graphs we show that \mathfrakT\mspace-</font >1.5mu\mathfrakP\mathfrak{T}\mspace{-1.5mu}\mathfrak{P}-width is NP-complete and we present fixed-parameter algorithms.
Research Interests:
Research Interests:
A clique-transversal set of a graph G is a sub- set of vertices intersecting all maximal cliques of G. The smallest possible cardinality τC (G) among all clique transversal sets for G is called clique transversal number. A clique... more
A clique-transversal set of a graph G is a sub- set of vertices intersecting all maximal cliques of G. The smallest possible cardinality τC (G) among all clique transversal sets for G is called clique transversal number. A clique independence set is a collection of vertex-disjoint maximal cliques of G. The largest possible cardinality αC (G) among all clique independent sets for G is called clique independence number. If equality of τC (H) and αC (H) always holds for every induced subgraph H of G, then the graph is called clique-perfect. The paper concentrates on the clique transver- sal and clique independence of distance-hereditary graphs. We present two polynomial time algo- rithms for finding the clique transversal number and the clique independence number of a given distance-hereditary graph.
Research Interests:
Research Interests:
Research Interests:
In this paper, we show that minimum clique-transversal and maximum clique-independent sets of a distance-hereditary graph have the same car- dinality, and the clique-transversal set problem can be solved in O(n + m) time and the... more
In this paper, we show that minimum clique-transversal and maximum clique-independent sets of a distance-hereditary graph have the same car- dinality, and the clique-transversal set problem can be solved in O(n + m) time and the clique-independent set problem can be solved in O(n2) time for distance- hereditary graphs.
Research Interests:
In this paper, we show that minimum clique-transversal and maximum clique-independent sets of a distance-hereditary graph have the same car- dinality, and the clique-transversal set problem can be solved in O(n + m) time and the... more
In this paper, we show that minimum clique-transversal and maximum clique-independent sets of a distance-hereditary graph have the same car- dinality, and the clique-transversal set problem can be solved in O(n + m) time and the clique-independent set problem can be solved in O(n2) time for distance- hereditary graphs.
Research Interests:
A maximum clique transversal set in a graph G is a set S of vertices such that every maximum clique of G contains at least a vertex in S. Clearly, removing a maximum clique transversal set reduces the clique number of a graph. We study... more
A maximum clique transversal set in a graph G is a set S of vertices such that every maximum clique of G contains at least a vertex in S. Clearly, removing a maximum clique transversal set reduces the clique number of a graph. We study algorithmic aspects of the problem, given a graph, to find a maximum clique transversal set
Research Interests:
Research Interests:
Butterflies are undirected graphs of bounded degree. They are widely used as interconnection networks. In this paper we study the feedback vertex set problem for butterflies. We show that the feedback vertex set found by Luccio's... more
Butterflies are undirected graphs of bounded degree. They are widely used as interconnection networks. In this paper we study the feedback vertex set problem for butterflies. We show that the feedback vertex set found by Luccio's algorithm [Inform. Process. Lett. 66 (1998) 59–64] for the k-dimensional butterfly Bk is of size ⌊(3k+1)2k+19⌋. Besides, we propose an algorithm to find a feedback
Research Interests:
Research Interests:
In this paper, we show that the clique-transversal number τC(G) and the clique-independence number αC(G) are equal for any distance-hereditary graph G. As a byproduct of proving that τC(G)=αC(G), we give a linear-time algorithm to find a... more
In this paper, we show that the clique-transversal number τC(G) and the clique-independence number αC(G) are equal for any distance-hereditary graph G. As a byproduct of proving that τC(G)=αC(G), we give a linear-time algorithm to find a minimum clique-transversal set and a maximum clique-independent set simultaneously for distance-hereditary graphs.