Disjoint path covers joining prescribed source and sink sets in interval graphs

2019 ◽  
Vol 776 ◽  
pp. 125-137 ◽  
Author(s):  
Jung-Heum Park ◽  
Jae-Hoon Kim ◽  
Hyeong-Seok Lim
Keyword(s):  
Interval Graphs ◽  
Disjoint Path ◽  
Source And Sink

Unpaired Many-to-Many Disjoint Path Cover of Balanced Hypercubes

2021 ◽  
pp. 1-14
Author(s):  
Huazhong Lü ◽  
Tingzeng Wu
Keyword(s):  
Network Topology ◽  
Upper Bound ◽  
Interconnection Network ◽  
Disjoint Paths ◽  
Disjoint Path ◽  
Path Cover ◽  
Balanced Hypercube ◽  
Vertex Disjoint ◽  
Appl Math ◽  
Source And Sink

A many-to-many [Formula: see text]-disjoint path cover ([Formula: see text]-DPC) of a graph [Formula: see text] is a set of [Formula: see text] vertex-disjoint paths joining [Formula: see text] distinct pairs of source and sink in which each vertex of [Formula: see text] is contained exactly once in a path. The balanced hypercube [Formula: see text], a variant of the hypercube, was introduced as a desired interconnection network topology. Let [Formula: see text] and [Formula: see text] be any two sets of vertices in different partite sets of [Formula: see text] ([Formula: see text]). Cheng et al. in [Appl. Math. Comput. 242 (2014) 127–142] proved that there exists paired many-to-many 2-disjoint path cover of [Formula: see text] when [Formula: see text]. In this paper, we prove that there exists unpaired many-to-many [Formula: see text]-disjoint path cover of [Formula: see text] ([Formula: see text]) from [Formula: see text] to [Formula: see text], which has improved some known results. The upper bound [Formula: see text] is best possible in terms of the number of disjoint paths in unpaired many-to-many [Formula: see text]-DPC of [Formula: see text].

scholarly journals Algorithms for finding disjoint path covers in unit interval graphs

2016 ◽  
Vol 205 ◽  
pp. 132-149 ◽  
Author(s):  
Jung-Heum Park ◽  
Joonsoo Choi ◽  
Hyeong-Seok Lim
Keyword(s):  
Unit Interval ◽  
Interval Graphs ◽  
Disjoint Path

Coordination between Source and Sink in Super Early and Late Rice

2009 ◽  
Vol 35 (9) ◽  
pp. 1744-1748 ◽  
Author(s):  
Xiao-Yue YUAN ◽  
Xiao-Hua PAN ◽  
Qing-Hua SHI ◽  
Jian-Fu WU ◽  
Ying-Xue QI
Keyword(s):  
Late Rice ◽  
Source And Sink

scholarly journals Claw-free graphs. III. Circular interval graphs

2008 ◽  
Vol 98 (4) ◽  
pp. 812-834 ◽  
Author(s):  
Maria Chudnovsky ◽  
Paul Seymour
Keyword(s):  
Interval Graphs

scholarly journals Computing the branchwidth of interval graphs

2005 ◽  
Vol 145 (2) ◽  
pp. 266-275 ◽  
Author(s):  
Ton Kloks ◽  
Jan Kratochvíl ◽  
Haiko Müller
Keyword(s):  
Interval Graphs
Sign in / Sign up

Export Citation Format

Share Document