Zobrazeno 1 - 10
of 51
pro vyhledávání: '"Leizhen Cai"'
Autor:
Leizhen Cai, Junjie Ye
Publikováno v:
Theoretical Computer Science. 795:275-284
We consider the problem of finding, for two pairs ( s 1 , t 1 ) and ( s 2 , t 2 ) of vertices in an undirected graph, an ( s 1 , t 1 ) -path P 1 and an ( s 2 , t 2 ) -path P 2 such that P 1 and P 2 share no edges and the length of each P i satisfies
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::09fb87f298fc71b63383af6b3745cdde
https://doi.org/10.1016/j.tcs.2019.07.009
https://doi.org/10.1016/j.tcs.2019.07.009
Autor:
Leizhen Cai, Ho Lam Pang
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030174019
CIAC
CIAC
An edge-bicolored graph is an undirected graph where each edge is colored exclusively either blue or red. We consider the following switching operation at vertices of edge-bicolored graphs: switching at a vertex changes colors of all edges incident w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ec1c616c344db14410176b1aa15a8894
https://doi.org/10.1007/978-3-030-17402-6_28
https://doi.org/10.1007/978-3-030-17402-6_28
Autor:
Junjie Ye, Leizhen Cai
Publikováno v:
Theoretical Computer Science. 607:49-59
For a graph property ?, i.e., a family ? of graphs, the Connected Induced?-Subgraph problem asks whether an input graph G contains k vertices V ' such that the induced subgraph G V ' is connected and satisfies property ?.In this paper, we study the p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d8d4c86de8367627b576ba595e847e00
https://doi.org/10.1016/j.tcs.2015.05.020
https://doi.org/10.1016/j.tcs.2015.05.020
Autor:
Leizhen Cai, Chengwei Guo
Publikováno v:
Theoretical Computer Science. 607:60-67
We study the parameterized complexity of the following Split Contraction problem: Given a graph G, and an integer k as parameter, determine whether G can be modified into a split graph by contracting at most k edges. We show that Split Contraction ca
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::48941cd6e6e9768488155f38c47bb19c
https://doi.org/10.1016/j.tcs.2015.01.056
https://doi.org/10.1016/j.tcs.2015.01.056
Autor:
Yufei Cai, Leizhen Cai
Publikováno v:
Algorithmica. 71:731-757
Given a fixed graph $$H$$H, the $$H$$H-Free Edge Deletion (resp., Completion, Editing) problem asks whether it is possible to delete from (resp., add to, delete from or add to) the input graph at most $$k$$k edges so that the resulting graph is $$H$$
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2dd52c149f362afb996dfc72f9107188
https://doi.org/10.1007/s00453-014-9937-x
https://doi.org/10.1007/s00453-014-9937-x
Autor:
LEIZHEN CAI1 lcai@cse.cuhk.edu.hk, YONGXI CHENG2 chengyx@mail.xjtu.edu.cn, ELAD VERBIN3 elad.verbin@gmail.com, YUAN ZHOU4 yuanzhou@cmu.edu
Publikováno v:
SIAM Journal on Discrete Mathematics. 2010, Vol. 24 Issue 4, p1322-1335. 14p.
Publikováno v:
In Information Processing Letters 1999 69(3):127-130
Autor:
Leizhen Cai, Boting Yang
Publikováno v:
Journal of Discrete Algorithms. 9:231-240
We study the parameterized complexity of the problems of determining whether a graph contains a k-edge subgraph (k-vertex induced subgraph) that is a Π-graph for Π-graphs being one of the following four classes of graphs: Eulerian graphs, even grap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::744bf75e60583c92ddd601ef5669edf9
https://doi.org/10.1016/j.jda.2011.03.004
https://doi.org/10.1016/j.jda.2011.03.004
Autor:
Leizhen Cai, Junjie Ye
Publikováno v:
Graph-Theoretic Concepts in Computer Science ISBN: 9783662535356
WG
WG
We consider the problem of finding, for two pairs $$s_1,t_1$$ and $$s_2,t_2$$ of vertices in an undirected graph, an $$s_1,t_1$$-path $$P_1$$ and an $$s_2,t_2$$-path $$P_2$$ such that $$P_1$$ and $$P_2$$ share no edges and the length of each $$P_i$$
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6a518b1ce4bb8e291920df23b80326bc
https://doi.org/10.1007/978-3-662-53536-3_6
https://doi.org/10.1007/978-3-662-53536-3_6
Autor:
Leizhen Cai
Publikováno v:
The Computer Journal. 51:102-121
We study the parameterized complexity of cardinality constrained optimization problems, i.e. optimization problems that require their solutions to contain specified numbers of elements to optimize solution values. For this purpose, we consider around
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2c1ca827ba6a8def92b47c0faad4f961
https://doi.org/10.1093/comjnl/bxm086
https://doi.org/10.1093/comjnl/bxm086