设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
CNKI学位论文(11)
知网期刊论文(1)
在“
Elsevier电子期刊
”中,
命中:
7
条,耗时:小于0.01 秒
在所有数据库中总计命中:
12
条
1.
Degree sum conditions for
vertex
-disjoint cycles passing through
specified
vertices
作者:
Shuya Chiba
a
;
schiba@kumamoto-u.ac.jp
;
Tomoki Yamashita
b
;
yamashita@math.kindai.ac.jp
关键词:
Vertex
-disjoint cycles
;
Partitions
;
Degree conditions
;
Specified
vertex
subsets
刊名:Discrete Mathematics
出版年:2017
2.
Bit selection via walks on graph for hash-based nearest neighbor search
作者:
Ya Wang
a
;
b
Author Vitae
;
Xianglong Liu
a
;
xlliu@nlsde.buaa.edu.cn" class="auth_mail" title="E-mail the corresponding author
Author Vitae
;
Danchen Zhang
c
Author Vitae
;
Deqing Wang
a
Author Vitae
;
Yuan Yang
b
Author Vitae
关键词:
Locality-sensitive hashing
;
Bit selection
;
Walk on graph
;
Compact hash codes
;
Complementary hash tables
;
Markov process
刊名:Neurocomputing
出版年:2016
3.
Enumerating minimal connected dominating sets in graphs of bounded chordality
作者:
Petr A. Golovach
a
;
petr.golovach@uib.no" class="auth_mail" title="E-mail the corresponding author
;
Pinar Heggernes
a
;
pinar.heggernes@uib.no" class="auth_mail" title="E-mail the corresponding author
;
Dieter Kratsch
b
;
dieter.kratsch@univ-lorraine.fr" class="auth_mail" title="E-mail the corresponding author
关键词:
Exact exponential algorithms
;
Enumeration
;
Minimal connected dominating sets
刊名:Theoretical Computer Science
出版年:2016
4.
More nonexistence results for symmetric pair coverings
作者:
Nevena Franceti膰
nfrancetic@gmail.com" class="auth_mail" title="E-mail the corresponding author
;
Sarada Herke
saradaherke@gmail.com" class="auth_mail" title="E-mail the corresponding author
;
Daniel Horsley
danhorsley@gmail.com" class="auth_mail" title="E-mail the corresponding author
关键词:
05B40
;
15A63
刊名:Linear Algebra and its Applications
出版年:2015
5.
On degree sum conditions for long cycles and cycles through
specified
vertices
作者:
Tomoki Yamashita
关键词:
Degree sum
;
Circumference
;
Cyclable
刊名:Discrete Mathematics
出版年:2008
6.
Studying Properties of Graphs through Their k-
vertex
Subsets
II. Notions of domination, coloring and covering
作者:
E. Sampathkumar
;
B.D. Acharya
;
Purnima Gupta
关键词:
Graph
;
k-degree
;
k-domination number
;
k-chromatic number
;
k-clique
;
k-
vertex
cover
刊名:Electronic Notes in Discrete Mathematics
出版年:2003
7.
A 2.5-factor approximation algorithm for the k-MST problem
作者:
Arya
;
Sunil
;
Ramesh
;
H.
关键词:
Algorithms
;
Approximation algorithms
;
k-MST problem
刊名:Information Processing Letters
出版年:1998
1
按检索点细分(7)
关键词(1)
文摘(4)
按出版年细分(7)
2017年(1)
2016年(2)
2015年(1)
2008年(1)
2003年(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
.