当前位置: X-MOL 学术Theor. Comput. Sci. › 论文详情
Characterization of interval graphs that are unpaired 2-disjoint path coverable
Theoretical Computer Science ( IF 0.718 ) Pub Date : 2020-03-24 , DOI: 10.1016/j.tcs.2020.03.010
Jung-Heum Park; Hyeong-Seok Lim

Given disjoint source and sink sets, S={s1,…,sk} and T={t1,…,tk}, in a graph G, an unpaired k-disjoint path cover joining S and T is a set of pairwise vertex-disjoint paths {P1,…,Pk} that altogether cover every vertex of the graph, in which Pi is a path from source si to some sink tj. In terms of a generalized scattering number, named an r-scattering number, we characterize interval graphs that have an unpaired 2-disjoint path cover joining S and T for any possible configurations of source and sink sets S and T of size 2 each. Also, it is shown that the r-scattering number of an interval graph can be computed in polynomial time.
更新日期:2020-03-26

 

全部期刊列表>>
聚焦肿瘤,探索癌症
欢迎探索2019年最具下载量的材料科学论文
论文语言润色服务
宅家赢大奖
如何将化学应用到可持续发展目标中
向世界展示您的会议墙报和演示文稿
全球疫情及响应:BMC Medicine专题征稿
新版X-MOL期刊搜索和高级搜索功能介绍
化学材料学全球高引用
ACS材料视界
x-mol收录
自然科研论文编辑服务
南方科技大学
南方科技大学
舒伟
中国科学院长春应化所于聪-4-8
复旦大学
课题组网站
X-MOL
香港大学化学系刘俊治
中山大学化学工程与技术学院
试剂库存
天合科研
down
wechat
bug