Search

Your search keyword '"Peng, Sheng Lung"' showing total 1,351 results
Start Over Author "Peng, Sheng Lung" Publication Type Reports Publication Type eBooks

Refine your results

more »

more »

1,351 results on '"Peng, Sheng Lung"'

1. The complexity of strong conflict-free vertex-connection $k$-colorability

Author

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

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

We study a new variant of graph coloring by adding a connectivity constraint. A path in a vertex-colored graph is called conflict-free if there is a color that appears exactly once on its vertices. A connected graph $G$ is said to be strongly conflict-free vertex-connection $k$-colorable if $G$ admits a vertex $k$-coloring such that any two distinct vertices of $G$ are connected by a conflict-free $shortest$ path. Among others, we show that deciding whether a given graph is strongly conflict-free vertex-connection $3$-colorable is NP-complete even when restricted to $3$-colorable graphs with diameter $3$, radius $2$ and domination number $3$, and, assuming the Exponential Time Hypothesis (ETH), cannot be solved in $2^{o(n)}$ time on such restricted input graphs with $n$ vertices. This hardness result is quite strong when compared to the ordinary $3$-COLORING problem: it is known that $3$-COLORING is solvable in polynomial time in graphs with bounded domination number, and assuming ETH, cannot be solved in $2^{o(\sqrt{n})}$ time in $n$-vertex graphs with diameter $3$ and radius $2$. On the positive side, we point out that a strong conflict-free vertex-connection coloring with minimum color number of a given split graph or a co-bipartite graph can be computed in polynomial time., Comment: The full version of a COCOON 2024 paper

Published
2024

2. 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

4. 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

5. 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

6. 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

9. 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

10. 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

11. 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

12. 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

13. 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

14. 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

15. 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

16. 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

17. 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

20. 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

24. A Cloud Server Selection System – Recommendation, Modeling and Evaluation

Author

Chang, Yao-Chung, Peng, Sheng-Lung, Chang, Ruay-Shiung, Hermanto, Hery, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Kobsa, Alfred, Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Hsu, Robert C.-H., editor, and Wang, Shangguang, editor

Published
2014
Full Text
View/download PDF

26. Measuring Protein Structural Similarity by Maximum Common Edge Subgraphs

Author

Peng, Sheng-Lung, Tsay, Yu-Wei, 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, Goebel, Randy, editor, Siekmann, Jörg, editor, Wahlster, Wolfgang, editor, Huang, De-Shuang, editor, Zhang, Xiang, editor, Reyes García, Carlos Alberto, editor, and Zhang, Lei, editor

Published
2010
Full Text
View/download PDF

27. CAPS Genomic Subtyping on Orthomyxoviridae

Author

Peng, Sheng-Lung, Tsay, Yu-Wei, Lin, Chich-Sheng, Tang, Chuan Yi, 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, Huang, De-Shuang, editor, Jo, Kang-Hyun, editor, Lee, Hong-Hee, editor, Kang, Hee-Jun, editor, and Bevilacqua, Vitoantonio, editor

Published
2009
Full Text
View/download PDF

28. Verification of Pathotyping by Quasispecies Model

Author

Peng, Sheng-Lung, Tsay, Yu-Wei, 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, Huang, De-Shuang, editor, Jo, Kang-Hyun, editor, Lee, Hong-Hee, editor, Kang, Hee-Jun, editor, and Bevilacqua, Vitoantonio, editor

Published
2009
Full Text
View/download PDF

29. Minimum Vertex Ranking Spanning Tree Problem on Permutation Graphs

Author

Chang, Ruei-Yuan, Lee, Guanling, Peng, Sheng-Lung, 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, Chen, Jianer, editor, and Cooper, S. Barry, editor

Published
2009
Full Text
View/download PDF

30. Block-Graph Width

Author

Chang, Maw-Shang, Hung, Ling-Ju, Kloks, Ton, Peng, Sheng-Lung, 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, Chen, Jianer, editor, and Cooper, S. Barry, editor

Published
2009
Full Text
View/download PDF

31. Probe Ptolemaic Graphs

Author

Chandler, David B., Chang, Maw-Shang, Kloks, Ton, Le, Van Bang, Peng, Sheng-Lung, 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, Hu, Xiaodong, editor, and Wang, Jie, editor

Published
2008
Full Text
View/download PDF

32. Protein Secondary Structure Prediction Based on Ramachandran Maps

Author

Chen, Yen-Ru, Peng, Sheng-Lung, Tsay, Yu-Wei, 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, Huang, De-Shuang, editor, Wunsch, Donald C., II, editor, Levine, Daniel S., editor, and Jo, Kang-Hyun, editor

Published
2008
Full Text
View/download PDF

33. Probe Selection with Fault Tolerance

Author

Peng, Sheng-Lung, Tsay, Yu-Wei, Wang, Tai-Chun, Tang, Chuan Yi, 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, Huang, De-Shuang, editor, Wunsch, Donald C., II, editor, Levine, Daniel S., editor, and Jo, Kang-Hyun, editor

Published
2008
Full Text
View/download PDF

35. On the Treewidth and Pathwidth of Biconvex Bipartite Graphs

Author

Peng, Sheng-Lung, Yang, Yi-Chuan, 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, Cai, Jin-Yi, editor, Cooper, S. Barry, editor, and Zhu, Hong, editor

Published
2007
Full Text
View/download PDF

36. Partitioned Probe Comparability Graphs

Author

Chandler, David B., Chang, Maw-Shang, Kloks, Ton, Liu, Jiping, Peng, Sheng-Lung, 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, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Fomin, Fedor V., editor

Published
2006
Full Text
View/download PDF

37. Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs

Author

Chandler, David B., Chang, Maw-Shang, Kloks, Ton, Liu, Jiping, Peng, Sheng-Lung, 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, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Cheng, Siu-Wing, editor, and Poon, Chung Keung, editor

Published
2006
Full Text
View/download PDF

38. On Probe Permutation Graphs

Author

Chandler, David B., Chang, Maw-Shang, Kloks, Antonius J. J., Liu, Jiping, Peng, Sheng-Lung, 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, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Cai, Jin-Yi, editor, Cooper, S. Barry, editor, and Li, Angsheng, editor

Published
2006
Full Text
View/download PDF

39. The PIGs Full Monty – A Floor Show of Minimal Separators

Author

Chang, Gerard Jennhwa, Kloks, Antonius J. J., Liu, Jiping, Peng, Sheng-Lung, 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, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Diekert, Volker, editor, and Durand, Bruno, editor

Published
2005
Full Text
View/download PDF

41. Roman Domination over Some Graph Classes

Author

Liedloff, Mathieu, Kloks, Ton, Liu, Jiping, Peng, Sheng-Lung, 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, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Kratsch, Dieter, editor

Published
2005
Full Text
View/download PDF

44. Edge and node searching problems on trees

Author

Peng, Sheng-Lung, Ho, Chin-Wen, Hsu, Tsan-sheng, Ko, Ming-Tat, Tang, Chuan-Yi, Goos, Gerhard, editor, Hartmanis, Juris, editor, van Leeuwen, Jan, editor, Jiang, Tao, editor, and Lee, D. T., editor

Published
1997
Full Text
View/download PDF

45. Graph searching on chordal graphs

Author

Peng, Sheng-Lung, Ko, Ming-Tat, Ho, Chin-Wen, Hsu, Tsan-sheng, Tang, Chuan-Yi, Goos, Gerhard, editor, Hartmanis, Juris, editor, van Leeuwen, Jan, editor, Asano, Tetsuo, editor, Igarashi, Yoshihide, editor, Nagamochi, Hiroshi, editor, Miyano, Satoru, editor, and Suri, Subhash, editor

Published
1996
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results