设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
中国地质文献-英文(4)
SpringerLink电子期刊(1689)
GSW全文库(17)
Wiley电子期刊(45)
ProQuest学位论文(100)
Elsevier电子期刊(2728)
Springer电子图书(15)
NATURE电子期刊(25)
ACS电子期刊(245)
在“
Elsevier电子期刊
”中,
命中:
2,728
条,耗时:0.0339831 秒
在所有数据库中总计命中:
4,868
条
1.
Canonical tree-
decomposition
s of a
graph
that display its k-blocks
作者:
Johannes Carmesin
;
J. Pascal Gollin
pascal.gollin@uni-hamburg.de
关键词:
Graph
;
Connectivity
;
Tree-
decomposition
;
k-Block
;
Tangle
;
Profile
刊名:Journal of Combinatorial Theory, Series B
出版年:2017
2.
ToTo: An open database for computation, storage and retrieval of tree
decomposition
s
作者:
Rim van Wersch
;
rim@tree
decomposition
s.com
;
Steven Kelk
;
steven.kelk@maastrichtuniversity.nl
关键词:
Treewidth
;
Tree
decomposition
;
Graph
s
;
Database
;
Algorithms
刊名:Discrete Applied Mathematics
出版年:2017
3.
Decomposition
of sparse
graph
s into forests: The Nine Dragon Tree Conjecture for k ≤ 2
作者:
Min Chen
a
;
1
;
chenmin@zjnu.edu.cn
;
Seog-Jin Kim
b
;
2
;
skim12@konkuk.ac.kr
;
Alexandr V. Kostochka
a
;
c
;
3
;
kostochk@math.uiuc.edu
;
Douglas B. West
a
;
c
;
4
;
west@math.uiuc.edu
;
Xuding Zhu
a
;
5
;
xdzhu@zjnu.edu.cn
关键词:
Nine Dragon Tree Conjecture
;
Arboricity
;
Nash-Williams Arboricity Formula
;
Fractional arboricity
;
Forest
;
Graph
decomposition
;
Discharging method
;
Sparse
graph
刊名:Journal of Combinatorial Theory, Series B
出版年:2017
4.
A Henneberg-based algorithm for generating tree-decomposable minimally rigid
graph
s
作者:
Marta R. Hidalgo
a
;
mhidalgo@cipf.es" class="auth_mail" title="E-mail the corresponding author
;
Robert Joan-Arinyo
b
;
robert@cs.upc.edu" class="auth_mail" title="E-mail the corresponding author
关键词:
Minimally rigid
graph
s
;
Laman
graph
s
;
Henneberg sequences
;
Geometric constraint solving
;
Geometric constraint
graph
s
;
Tree-
decomposition
刊名:Journal of Symbolic Computation
出版年:2017
5.
Ordinals and
graph
decomposition
s
作者:
Stephen Flood
;
sflood@alumni.nd.edu
关键词:
primary
;
03B80
;
secondary
;
05C63
;
03D80
;
03D35
刊名:Annals of Pure and Applied Logic
出版年:2017
6.
Equitable
decomposition
s of
graph
s with symmetries
作者:
Wayne Barrett
a
;
wb@mathematics.byu.edu" class="auth_mail" title="E-mail the corresponding author
;
Amanda Francis
b
;
afrancis@carroll.edu" class="auth_mail" title="E-mail the corresponding author
;
Benjamin Webb
a
;
bwebb@math.byu.edu" class="auth_mail" title="E-mail the corresponding author
关键词:
05C50
刊名:Linear Algebra and its Applications
出版年:2017
7.
Decomposing highly edge-connected
graph
s into homomorphic copies of a fixed tree
作者:
Martin Merker
marmer@dtu.dk
关键词:
Edge-
decomposition
;
Trees
;
Edge-connectivity
刊名:Journal of Combinatorial Theory, Series B
出版年:2017
8.
Approximate association via dissociation
作者:
Jie You
a
;
b
;
Jianxin Wang
a
;
Yixin Cao
b
;
yixin.cao@polyu.edu.hk
关键词:
Association set (cluster vertex deletion)
;
Dissociation set
;
Cluster
graph
;
Modular
decomposition
;
Triangle-free
graph
刊名:Discrete Applied Mathematics
出版年:2017
9.
Simple DFS on the complement of a
graph
and on partially complemented di
graph
s
作者:
Benson Joeris
a
;
Nathan Lindzey
b
;
nlindzey@uwaterloo.ca" class="auth_mail" title="E-mail the corresponding author
;
Ross M. McConnell
c
;
Nissa Osheim
c
关键词:
Depth-first search
;
Graph
algorithms
;
Graph
traversal
;
Partially complemented di
graph
s
刊名:Information Processing Letters
出版年:2017
10.
Preparation and lithium storage properties of NiO-SnO
2
/
graph
ene nanosheet ternary composites
作者:
Zhao Wang
;
Jiechen Mu
;
Yong Li
;
Jin Chen
;
Lipeng Zhang
;
zhang2015sdut@163.com
;
Degang Li
;
Pingping Zhao
关键词:
NiO-SnO2/
graph
ene nanosheets
;
Anode materials
;
Lithium-ion batteries
刊名:Journal of Alloys and Compounds
出版年:2017
1
2
3
4
5
6
7
8
9
按检索点细分(2728)
题名(260)
关键词(528)
文摘(2077)
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
.