Search

Your search keyword '"PENG, SHENG-LUNG"' showing total 1,608 results
Start Over Author "PENG, SHENG-LUNG" Search Limiters Peer Reviewed

Refine your results

more »

more »

more »

more »
1,608 results on '"PENG, SHENG-LUNG"'

2. Abbreviation

Author

Karthika Renuka, D., additional, Agarwal, Sonali, additional, and Peng, Sheng-Lung, additional

Published
2024
Full Text
View/download PDF

3. On the $d$-Claw Vertex Deletion Problem

Author

Hsieh, Sun-Yuan, Le, Hoang-Oanh, Le, Van Bang, and Peng, Sheng-Lung

Subjects
Computer Science - Discrete Mathematics, Computer Science - Data Structures and Algorithms
Abstract

Let $d$-claw (or $d$-star) stand for $K_{1,d}$, the complete bipartite graph with 1 and $d\ge 1$ vertices on each part. The $d$-claw vertex deletion problem, $d$-CLAW-VD, asks for a given graph $G$ and an integer $k$ if one can delete at most $k$ vertices from $G$ such that the resulting graph has no $d$-claw as an induced subgraph. Thus, 1-CLAW-VD and 2-CLAW-VD are just the famous VERTEX COVER problem and the CLUSTER VERTEX DELETION problem, respectively. In this paper, we strengthen a hardness result in [M. Yannakakis, Node-Deletion Problems on Bipartite Graphs, SIAM J. Comput. (1981)], by showing that CLUSTER VERTEX DELETION remains NP-complete when restricted to bipartite graphs of maximum degree 3. Moreover, for every $d\ge 3$, we show that $d$-CLAW-VD is NP-complete even when restricted to bipartite graphs of maximum degree $d$. These hardness results are optimal with respect to degree constraint. By extending the hardness result in [F. Bonomo-Braberman et al., Linear-Time Algorithms for Eliminating Claws in Graphs, COCOON 2020], we show that, for every $d\ge 3$, $d$-CLAW-VD is NP-complete even when restricted to split graphs without $(d+1)$-claws, and split graphs of diameter 2. On the positive side, we prove that $d$-CLAW-VD is polynomially solvable on what we call $d$-block graphs, a class properly contains all block graphs. This result extends the polynomial-time algorithm in [Y. Cao et al., Vertex deletion problems on chordal graphs, Theor. Comput. Sci. (2018)] for 2-CLAW-VD on block graphs to $d$-CLAW-VD for all $d\ge 2$ and improves the polynomial-time algorithm proposed by F. Bonomo-Brabeman et al. for (unweighted) 3-CLAW-VD on block graphs to 3-block graphs.

Published
2022

7. On Multi-objective Fuzzy Shortest Path Problem

Author

Halder, Swapna, Majumder, Saibal, Biswas, Arindam, Mandal, Bijoy Kumar, Peng, Sheng-Lung, Angrisani, Leopoldo, Series Editor, Arteaga, Marco, Series Editor, Chakraborty, Samarjit, Series Editor, Chen, Jiming, Series Editor, Chen, Shanben, Series Editor, Chen, Tan Kay, Series Editor, Dillmann, Rüdiger, Series Editor, Duan, Haibin, Series Editor, Ferrari, Gianluigi, Series Editor, Ferre, Manuel, Series Editor, Jabbari, Faryar, Series Editor, Jia, Limin, Series Editor, Kacprzyk, Janusz, Series Editor, Khamis, Alaa, Series Editor, Kroeger, Torsten, Series Editor, Li, Yong, Series Editor, Liang, Qilian, Series Editor, Martín, Ferran, Series Editor, Ming, Tan Cher, Series Editor, Minker, Wolfgang, Series Editor, Misra, Pradeep, Series Editor, Mukhopadhyay, Subhas, Series Editor, Ning, Cun-Zheng, Series Editor, Nishida, Toyoaki, Series Editor, Oneto, Luca, Series Editor, Panigrahi, Bijaya Ketan, Series Editor, Pascucci, Federica, Series Editor, Qin, Yong, Series Editor, Seng, Gan Woon, Series Editor, Speidel, Joachim, Series Editor, Veiga, Germano, Series Editor, Wu, Haitao, Series Editor, Zamboni, Walter, Series Editor, Zhang, Junjie James, Series Editor, Tan, Kay Chen, Series Editor, Chakraborty, Basabi, editor, Biswas, Arindam, editor, and Chakrabarti, Amlan, editor

Published
2023
Full Text
View/download PDF

8. The Factors that Influence the Customer Demands for Automobile Battery Industry Based on Market Dynamics

Author

Pradhan, Sandip, Peng, Sheng-Lung, Kacprzyk, Janusz, Series Editor, Gomide, Fernando, Advisory Editor, Kaynak, Okyay, Advisory Editor, Liu, Derong, Advisory Editor, Pedrycz, Witold, Advisory Editor, Polycarpou, Marios M., Advisory Editor, Rudas, Imre J., Advisory Editor, Wang, Jun, Advisory Editor, Chaki, Nabendu, editor, Roy, Nilanjana Dutta, editor, Debnath, Papiya, editor, and Saeed, Khalid, editor

Published
2023
Full Text
View/download PDF

10. Fault Diagnosability of Multigraph Matching Composition Networks

Author

Qin, Xiao-Wen, Hao, Rong-Xia, Peng, Sheng-Lung, Filipe, Joaquim, Editorial Board Member, Ghosh, Ashish, Editorial Board Member, Prates, Raquel Oliveira, Editorial Board Member, Zhou, Lizhu, Editorial Board Member, Hsieh, Sun-Yuan, editor, Hung, Ling-Ju, editor, Klasing, Ralf, editor, Lee, Chia-Wei, editor, and Peng, Sheng-Lung, editor

Published
2022
Full Text
View/download PDF

18. On the d-Claw Vertex Deletion Problem

Author

Hsieh, Sun-Yuan, Le, Van Bang, Peng, Sheng-Lung, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Chen, Chi-Yeh, editor, Hon, Wing-Kai, editor, Hung, Ling-Ju, editor, and Lee, Chia-Wei, editor

Published
2021
Full Text
View/download PDF

20. On the complete width and edge clique cover problems

Author

Le, Van Bang and Peng, Sheng-Lung

Subjects
Computer Science - Discrete Mathematics, Mathematics - Combinatorics
Abstract

A complete graph is the graph in which every two vertices are adjacent. For a graph $G=(V,E)$, the complete width of $G$ is the minimum $k$ such that there exist $k$ independent sets $\mathtt{N}_i\subseteq V$, $1\le i\le k$, such that the graph $G'$ obtained from $G$ by adding some new edges between certain vertices inside the sets $\mathtt{N}_i$, $1\le i\le k$, is a complete graph. The complete width problem is to decide whether the complete width of a given graph is at most $k$ or not. In this paper we study the complete width problem. We show that the complete width problem is NP-complete on $3K_2$-free bipartite graphs and polynomially solvable on $2K_2$-free bipartite graphs and on $(2K_2,C_4)$-free graphs. As a by-product, we obtain the following new results: the edge clique cover problem is NP-complete on $\overline{3K_2}$-free co-bipartite graphs and polynomially solvable on $C_4$-free co-bipartite graphs and on $(2K_2, C_4)$-free graphs. We also give a characterization for $k$-probe complete graphs which implies that the complete width problem admits a kernel of at most $2^k$ vertices. This provides another proof for the known fact that the edge clique cover problem admits a kernel of at most $2^k$ vertices. Finally we determine all graphs of small complete width $k\le 3$., Comment: Extended version of COCOON 2015 paper. Accepted by Journal of Combinatorial Optimization

Published
2016

21. Good characterizations and linear time recognition for 2-probe block graphs

Author

Le, Van Bang and Peng, Sheng-Lung

Subjects
Mathematics - Combinatorics, Computer Science - Discrete Mathematics
Abstract

Block graphs are graphs in which every block (biconnected component) is a clique. A graph $G=(V,E)$ is said to be an (unpartitioned) $k$-probe block graph if there exist $k$ independent sets $N_i\subseteq V$, $1\le i\le k$, such that the graph $G'$ obtained from $G$ by adding certain edges between vertices inside the sets $N_i$, $1\le i\le k$, is a block graph; if the independent sets $N_i$ are given, $G$ is called a partitioned $k$-probe block graph. In this paper we give good characterizations for $2$-probe block graphs, in both unpartitioned and partitioned cases. As an algorithmic implication, partitioned and unpartitioned probe block graphs can be recognized in linear time, improving a recognition algorithm of cubic time complexity previously obtained by Chang et al. [Block-graph width, Theoretical Computer Science 412 (2011), 2496--2502].

Published
2016

27. Correction to: Micro-Electronics and Telecommunication Engineering

Author

Sharma, Devendra Kumar, Peng, Sheng-Lung, Sharma, Rohit, Zaitsev, Dmitry A., Kacprzyk, Janusz, Series Editor, Gomide, Fernando, Advisory Editor, Kaynak, Okyay, Advisory Editor, Liu, Derong, Advisory Editor, Pedrycz, Witold, Advisory Editor, Polycarpou, Marios M., Advisory Editor, Rudas, Imre J., Advisory Editor, Wang, Jun, Advisory Editor, Sharma, Devendra Kumar, editor, Peng, Sheng-Lung, editor, Sharma, Rohit, editor, and Zaitsev, Dmitry A., editor

Published
2022
Full Text
View/download PDF

28. An Extension of Attack Trees

Author

Kao, Yi-Chih, Hwang, Yuan-Ping, Wang, Shih-Chen, Peng, Sheng-Lung, Kacprzyk, Janusz, Series Editor, Pal, Nikhil R., Advisory Editor, Bello Perez, Rafael, Advisory Editor, Corchado, Emilio S., Advisory Editor, Hagras, Hani, Advisory Editor, Kóczy, László T., Advisory Editor, Kreinovich, Vladik, Advisory Editor, Lin, Chin-Teng, Advisory Editor, Lu, Jie, Advisory Editor, Melin, Patricia, Advisory Editor, Nedjah, Nadia, Advisory Editor, Nguyen, Ngoc Thanh, Advisory Editor, Wang, Jun, Advisory Editor, Peng, Sheng-Lung, editor, Wang, Shiuh-Jeng, editor, Balas, Valentina Emilia, editor, and Zhao, Ming, editor

Published
2018
Full Text
View/download PDF

29. Matching Cut in Graphs with Large Minimum Degree

Author

Hsieh, Sun-Yuan, Le, Hoang-Oanh, Le, Van Bang, Peng, Sheng-Lung, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Du, Ding-Zhu, editor, Duan, Zhenhua, editor, and Tian, Cong, editor

Published
2019
Full Text
View/download PDF

30. Preface

Author

N, Pradeep, primary, Kautish, Sandeep, additional, and Peng, Sheng-Lung, additional

Published
2021
Full Text
View/download PDF

31. Overview

Author

N, Pradeep, primary, Kautish, Sandeep, additional, and Peng, Sheng-Lung, additional

Published
2021
Full Text
View/download PDF

33. A Pairwise Alignment Algorithm for Long Sequences of High Similarity

Author

Lee, Chien-Tai, Peng, Sheng-Lung, Kacprzyk, Janusz, Series editor, Pal, Nikhil R., Advisory editor, Bello Perez, Rafael, Advisory editor, Corchado, Emilio S., Advisory editor, Hagras, Hani, Advisory editor, Kóczy, László T., Advisory editor, Kreinovich, Vladik, Advisory editor, Lin, Chin-Teng, Advisory editor, Lu, Jie, Advisory editor, Melin, Patricia, Advisory editor, Nedjah, Nadia, Advisory editor, Nguyen, Ngoc Thanh, Advisory editor, Wang, Jun, Advisory editor, Mishra, Durgesh Kumar, editor, Azar, Ahmad Taher, editor, and Joshi, Amit, editor

Published
2018
Full Text
View/download PDF

34. On the Cooperative Graph Searching Problem

Author

Lin, Chin-Fu, Navrátil, Ondřej, Peng, Sheng-Lung, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Weikum, Gerhard, Series Editor, Tian, Cong, editor, Nagoya, Fumiko, editor, Liu, Shaoying, editor, and Duan, Zhenhua, editor

Published
2018
Full Text
View/download PDF

36. Depth Map Super-Resolution Based on Semi-Couple Deformable Convolution Networks.

Author

Liu, Botao, Chen, Kai, Peng, Sheng-Lung, and Zhao, Ming

Subjects
FEATURE extraction, PROBLEM solving, DEEP learning
Abstract

Depth images obtained from lightweight, real-time depth estimation models and consumer-oriented sensors typically have low-resolution issues. Traditional interpolation methods for depth image up-sampling result in a significant information loss, especially in edges with discontinuous depth variations (depth discontinuities). To address this issue, this paper proposes a semi-coupled deformable convolution network (SCD-Net) based on the idea of guided depth map super-resolution (GDSR). The method employs a semi-coupled feature extraction scheme to learn unique and similar features between RGB images and depth images. We utilize a Coordinate Attention (CA) to suppress redundant information in RGB features. Finally, a deformable convolutional module is employed to restore the original resolution of the depth image. The model is tested on NYUv2, Middlebury, Lu, and a Real-Sense real-world dataset created using an Intel Real-sense D455 structured-light camera. The super-resolution accuracy of SCD-Net at multiple scales is much higher than that of traditional methods and superior to recent state-of-the-art (SOTA) models, which demonstrates the effectiveness and flexibility of our model on GDSR tasks. In particular, our method further solves the problem of an RGB texture being over-transferred in GDSR tasks. [ABSTRACT FROM AUTHOR]

Published
2023
Full Text
View/download PDF

38. On multi-objective minimum spanning tree under the framework of uncertainty theory.

Author

Halder, Swapna, Majumder, Saibal, Biswas, Arindam, Mandal, Bijoy Kumar, and Peng, Sheng-Lung

Subjects
SPANNING trees, SOCIAL problems, PROBLEM solving
Abstract

Aminimum spanning tree with multiple objectives is one type of NP hard problem, and it has a wide application area in ourdaily life. Modelling real world problems, requires many associated parameters which are not well-defined and are indeterminate in nature. Thus, it is rational to consider these indeterminate parameters while modelling real life problems. This article, investigates onthe study of minimum spanning tree with multiple objectives which are uncertain in nature. The proposed multiple objectives minimum spanning tree has two uncertain parameters associated with it, they are time and cost. Both of these parameters are indeterminate in nature and characterizedas uncertain variables. The expected value model (EVM) of multiple objectives minimum spanning tree is formulatedin this study and convex combination method is used to solve this problem. Finally to achieve the nondominated solutions of this problem, we have solved the EVM by varying the related weights of its objectives. [ABSTRACT FROM AUTHOR]

Published
2023
Full Text
View/download PDF

42. Algorithmic Aspects of Disjunctive Total Domination in Graphs

Author

Lin, Chin-Fu, Peng, Sheng-Lung, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Chan, T-H. Hubert, editor, Li, Minming, editor, and Wang, Lusheng, editor

Published
2016
Full Text
View/download PDF

46. On the Complete Width and Edge Clique Cover Problems

Author

Le, Van Bang, Peng, Sheng-Lung, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Xu, Dachuan, editor, Du, Donglei, editor, and Du, Dingzhu, editor

Published
2015
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results