Search

Your search keyword '"Lee, Chuan-Min"' showing total 32 results
Start Over Author "Lee, Chuan-Min"
32 results on '"Lee, Chuan-Min"'

2. Exploring Clique Transversal Variants on Distance-Hereditary Graphs: Computational Insights and Algorithmic Approaches.

Author

Lee, Chuan-Min

Subjects
*GRAPH theory, *DYNAMIC programming, *TRANSVERSAL lines, *ALGORITHMS, *INTERSECTION graph theory
Abstract

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 clique, and signed clique transversal problems—have received significant interest due to their theoretical importance and practical applications. This paper examines the k-fold clique, { k } -clique, minus clique, and signed clique transversal problems on distance-hereditary graphs. Known for their distinctive structural properties, distance hereditary graphs provide an ideal framework for studying these problem variants. By exploring these issues in the context of distance-hereditary graphs, this research enhances the understanding of the computational challenges and the potential for developing efficient algorithms to address these problems. [ABSTRACT FROM AUTHOR]

Published
2024
Full Text
View/download PDF

3. Total k-Domatic Partition and Weak Elimination Ordering

Author

Lee, Chuan-Min, Barbosa, Simone Diniz Junqueira, Editorial Board Member, Filipe, Joaquim, Editorial Board Member, Ghosh, Ashish, Editorial Board Member, Kotenko, Igor, Editorial Board Member, Yuan, Junsong, Editorial Board Member, Zhou, Lizhu, Editorial Board Member, Chang, Chuan-Yu, editor, Lin, Chien-Chou, editor, and Lin, Horng-Horng, editor

Published
2019
Full Text
View/download PDF

6. Trivially-Perfect Width

Author

Hung, Ling-Ju, Kloks, Ton, Lee, Chuan Min, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Fiala, Jiří, editor, Kratochvíl, Jan, editor, and Miller, Mirka, editor

Published
2009
Full Text
View/download PDF

8. Maximum Clique Transversals

Author

Chang, Maw-Shang, Kloks, Ton, Lee, Chuan-Min, Goos, Gerhard, editor, Hartmanis, Juris, editor, van Leeuwen, Jan, editor, Brandstädt, Andreas, editor, and Le, Van Bang, editor

Published
2001
Full Text
View/download PDF

22. On the complexity of variations of mixed domination on graphs.

Author

Lee, Chuan-Min

Subjects
*DOMINATING set, *PATHS & cycles in graph theory, *NP-complete problems, *PROBLEM solving, *LINEAR systems
Abstract

This paper is motivated by the concept of themixed dominationproblem on graphs and dedicated to the complexity of variations of the problem such as thesigned mixed domination,signed edge domination,minus mixed domination, andminus edge dominationproblems. In this paper, we present NP-completeness and MAX SNP-hardness results for some of them, and present a general framework of solving these problems and various dominating and covering problems for trees in linear time. [ABSTRACT FROM PUBLISHER]

Published
2016
Full Text
View/download PDF

32. Improved bottleneck domination algorithms

Author

Kloks, Ton, Kratsch, Dieter, Lee, Chuan-Min, and Liu, Jiping

Subjects
*ALGORITHMS, *DOMINATING set, *GRAPH theory, *BOTTLENECKS (Manufacturing)
Abstract

Abstract: W.C.K. Yen introduced BOTTLENECK DOMINATION and BOTTLENECK INDEPENDENT DOMINATION. He presented an -time algorithm to compute a minimum bottleneck dominating set. He also obtained that the BOTTLENECK INDEPENDENT DOMINATING SET problem is NP-complete, even when restricted to planar graphs. We present simple linear time algorithms for the BOTTLENECK DOMINATING SET and the BOTTLENECK TOTAL DOMINATING SET problem. Furthermore, we give polynomial time algorithms (most of them with linear time-complexities) for the BOTTLENECK INDEPENDENT DOMINATING SET problem on the following graph classes: AT-free graphs, chordal graphs, split graphs, permutation graphs, graphs of bounded treewidth, and graphs of clique-width at most k with a given k-expression. [Copyright &y& Elsevier]

Published
2006
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results