设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
GSW全文库(1)
Springer电子图书(5)
CNKI学位论文(1172)
CNKI期刊论文0611(1)
知网期刊论文(312)
在“
Elsevier电子期刊
”中,
命中:
428
条,耗时:0.1009492 秒
在所有数据库中总计命中:
1,491
条
1.
Counting independent
set
s in tree convex bipartite graphs
作者:
Min-Sheng Lin
;
mslin@ee.ntut.edu.tw
;
Chien-Min Chen
关键词:
Tree convex bipartite graphs
;
Independent
set
s
;
Maximal independent
set
s
;
Independent perfect
dominating
set
s
;
Counting
problem
刊名:Discrete Applied Mathematics
出版年:2017
2.
Improved distributed local approximation algorithm for minimum 2-
dominating
set
in planar graphs
作者:
A. Czygrinow
a
;
aczygri@asu.edu
;
M. Hanćkowiak
b
;
mhanckow@amu.edu.pl
;
E. Szymańska
b
;
edka@amu.edu.pl
;
W. Wawrzyniak
b
;
wwawrzy@amu.edu.pl
;
M. Witkowski
b
;
mw@amu.edu.pl
关键词:
Distributed graph algorithms
刊名:Theoretical Computer Science
出版年:2017
3.
A linear kernel for planar red-blue
dominating
set
作者:
Valentin Garnero
a
;
valentin.garnero@lirmm.fr
;
Ignasi Sau
b
;
ignasi.sau@lirmm.fr
;
Dimitrios M. Thilikos
b
;
c
;
sedthilk@thilikos.info
关键词:
Parameterized complexity
;
Planar graphs
;
Linear kernels
;
Red&ndash
;
blue domination
刊名:Discrete Applied Mathematics
出版年:2017
4.
Italian domination in trees
作者:
Michael A. Henning
a
;
mahenning@uj.ac.za
;
William F. Klostermeyer
b
;
wkloster@unf.edu
关键词:
Dominating
set
;
Roman {2}{2}-
dominating
set
;
Tree
刊名:Discrete Applied Mathematics
出版年:2017
5.
Improved kernel results for some FPT
problem
s based on simple observations
作者:
Wenjun Li
a
;
b
;
Qilong Feng
a
;
csufeng@mail.csu.edu.cn
;
Jianer Chen
a
;
c
;
Shuai Hu
a
关键词:
Fixed-parameter tractability
;
NP-hard
;
Kernelization
刊名:Theoretical Computer Science
出版年:2017
6.
Graphs with maximal induced matchings of the same size
关键词:
Induced matching
;
Well-covered graph
;
Optimization
problem
;
Computational complexity
;
Forbidden induced subgraph
刊名:Discrete Applied Mathematics
出版年:2017
7.
On the independence transversal total domination number of graphs
作者:
Abel Cabrera Martí
;
nez
a
;
José
;
M. Sigarreta Almira
a
;
Ismael G. Yero
b
;
ismael.gonzalez@uca.es
关键词:
Independence transversal total domination number
;
Total domination number
;
Independence number
刊名:Discrete Applied Mathematics
出版年:2017
8.
Graphs that are simultaneously efficient open domination and efficient closed domination graphs
作者:
Sandi Klavžar
a
;
b
;
c
;
sandi.klavzar@fmf.uni-lj.si
;
Iztok Peterin
c
;
d
;
iztok.peterin@um.si
;
Ismael G. Yero
e
;
ismael.gonzalez@uca.es
关键词:
Efficient open domination
;
Efficient closed domination
;
Perfect code
;
Computational complexity
;
Tree
;
Sierpiński graph
刊名:Discrete Applied Mathematics
出版年:2017
9.
Complexity and kernels for bipartition into degree-bounded induced graphs
作者:
Mingyu Xiao
a
;
myxiao@uestc.edu.cn
;
Hiroshi Nagamochi
b
;
nag@amp.i.kyoto-u.ac.jp
关键词:
Graph algorithms
;
Bipartition
;
Kernelization
;
NP-hard
;
Fixed-parameter tractable
刊名:Theoretical Computer Science
出版年:2017
10.
Construction of minimum connected
dominating
set
in wireless sensor networks using pseudo
dominating
set
作者:
Jasaswi Prasad Mohanty
;
a
;
jasaswiprasad@gmail.com" class="auth_mail" title="E-mail the corresponding author
;
jasaswiprasad@rediffmail.com" class="auth_mail" title="E-mail the corresponding author
Author Vitae
;
Chittaranjan Mandal
a
Author Vitae
;
Chris Reade
b
Author Vitae
;
Ariyam Das
c
Author Vitae
关键词:
Connected
Dominating
Set
(CDS)
;
Maximal independent
set
(MIS)
;
Wireless sensor networks
;
Unit disk graph (UDG)
;
Steiner Tree
刊名:Ad Hoc Networks
出版年:2016
1
2
3
4
5
6
7
8
9
按检索点细分(428)
题名(27)
关键词(27)
文摘(369)
按出版年细分(428)
2027年及以后(13)
2017年(10)
2016年(30)
2015年(12)
2013年(30)
2012年(38)
2011年(43)
2010年(28)
2009年(35)
2008年(26)
2007年(25)
2006年(23)
2005年(13)
2004年(17)
2003年(11)
2002年(14)
2001年(8)
2000年(8)
2000年及以前(44)
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
.