设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
CNKI学位论文(5)
知网期刊论文(6)
在“
Elsevier电子期刊
”中,
命中:
13
条,耗时:0.0610002 秒
在所有数据库中总计命中:
11
条
1.
A linear-time algorithm for finding a
paired
2-
disjoint
path
cover
in the cube of a connected graph
作者:
Insung Ihm
a
;
ihm@sogang.ac.kr
;
Jung-Heum Park
b
;
j.h.park@catholic.ac.kr
关键词:
Disjoint
path
cover
;
Cube of graph
;
Hamiltonian
path
;
Spanning tree
;
Unicyclic graph
;
Linear-time algorithm
刊名:Discrete Applied Mathematics
出版年:2017
2.
Paired
many-to-many
disjoint
path
cover
s of hypertori
作者:
Brian G. Kronenthal
;
kronenthal@kutztown.edu
;
Wing Hong Tony Wong
wong@kutztown.edu
关键词:
Disjoint
path
cover
s
;
Hypertorus
;
Torus
;
Flow Free
刊名:Discrete Applied Mathematics
出版年:2017
3.
Paired
many-to-many
disjoint
path
cover
s in restricted hypercube-like graphs
作者:
Jung-Heum Park
j.h.park@catholic.ac.kr" class="auth_mail" title="E-mail the corresponding author
关键词:
Hypercube-like graph
;
Disjoint
path
;
Path
cover
;
Path
partition
;
Fault tolerance
;
Interconnection network
刊名:Theoretical Computer Science
出版年:2016
4.
Ore-type degree conditions for
disjoint
path
cover
s in simple graphs
作者:
Hyeong-Seok Lim
a
;
hslim@chonnam.ac.kr" class="auth_mail" title="E-mail the corresponding author
;
Hee-Chul Kim
b
;
hckim@hufs.ac.kr" class="auth_mail" title="E-mail the corresponding author
;
Jung-Heum Park
c
;
j.h.park@catholic.ac.kr" class="auth_mail" title="E-mail the corresponding author
关键词:
Ore&rsquo
;
s theorem
;
Degree condition
;
Disjoint
path
cover
;
Path
partition
;
Hamiltonian-connected
刊名:Discrete Mathematics
出版年:2016
5.
Paired
2-
disjoint
path
cover
s of faulty k-ary n-cubes
作者:
Xie-Bin Chen
chenxbfz@163.com" class="auth_mail" title="E-mail the corresponding author
关键词:
Paired
disjoint
path
cover
;
Fault-tolerance
;
k-ary n-cube
;
Cartesian product of graphs
;
Interconnection network
刊名:Theoretical Computer Science
出版年:2016
6.
Paired
2-
disjoint
path
cover
s of multidimensional torus networks with faulty edges
作者:
Xie-Bin Chen
chenxbfz@163.com" class="auth_mail" title="E-mail the corresponding author
关键词:
Paired
disjoint
path
cover
;
Fault-tolerance
;
Multidimensional torus
;
Cartesian product of graphs
;
Interconnection network
刊名:Information Processing Letters
出版年:2016
7.
Disjoint
path
cover
s in cubes of connected graphs
作者:
Jung-Heum Park
a
;
j.h.park@catholic.ac.kr" class="auth_mail
;
Insung Ihm
b
;
ihm@sogang.ac.kr" class="auth_mail
关键词:
Disjoint
path
cover
;
Strong hamiltonicity
;
Hamiltonian
path
;
Prescribed edge
;
Cube of graph
刊名:Discrete Mathematics
出版年:28 June, 2014
8.
Many-to-many two-
disjoint
path
cover
s in restricted hypercube-like graphs
作者:
Sook-Yeon Kim
a
;
sookyeon@hknu.ac.kr" class="auth_mail
;
Jung-Heum Park
b
;
j.h.park@catholic.ac.kr" class="auth_mail
关键词:
Disjoint
path
cover
;
Hypercube-like graph
;
Hamiltonian
path
;
Hamiltonian cycle
;
RHL graph
;
Fault tolerance
;
Interconnection network
刊名:Theoretical Computer Science
出版年:24 April, 2014
9.
Paired
many-to-many
disjoint
path
cover
s of the hypercubes
作者:
Xie-Bin Chen
chenxbfz@yahoo.com.cn
关键词:
Hypercube
;
Hamiltonian
path
;
Disjoint
path
s
;
Many-to-many
disjoint
path
cover
;
Interconnection networks
刊名:Information Sciences
出版年:2013
10.
Paired
2-
disjoint
path
cover
s and strongly Hamiltonian laceability of bipartite hypercube-like graphs
作者:
Shinhaeng Jo
a
;
josh@jupiter.kaist.ac.kr
;
Jung-Heum Park
b
;
j.h.park@catholic.ac.kr
;
Kyung Yong Chwa
a
;
kychwa@jupiter.kaist.ac.kr
关键词:
Disjoint
path
;
Strongly Hamiltonian-laceable
;
Hamiltonian
path
;
Bipartite HL-graph
;
Graph theory
;
Fault tolerance
刊名:Information Sciences
出版年:2013
1
2
按检索点细分(13)
题名(9)
关键词(2)
文摘(12)
按出版年细分(13)
2027年及以后(2)
2017年(2)
2016年(4)
2013年(3)
2012年(1)
2000年及以前(1)
NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via
email
.