设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
Wiley电子期刊(1)
SpringerLink电子期刊(74)
Elsevier电子期刊(56)
Springer电子图书(2)
ProQuest学位论文(5)
在“
Elsevier电子期刊
”中,
命中:
56
条,耗时:0.058972 秒
在所有数据库中总计命中:
138
条
1.
Minimal
dominating
set
s in interval graphs and trees
作者:
Petr A. Golovach
a
;
petr.golovach@uib.no
;
Pinar Heggernes
a
;
pinar.heggernes@uib.no
;
Mamadou Moustapha Kanté
;
b
;
mamadou.kante@isima.fr
;
Dieter Kratsch
c
;
dieter.kratsch@univ-lorraine.fr
;
Yngve Villanger
a
;
yngve.villanger@gmail.com
关键词:
Graphs
;
Minimal
dominating
set
s
;
Graph classes
;
Enumeration
刊名:Discrete Applied Mathematics
出版年:2017
2.
Characterizing
minimal
point
set
dominating
set
s
作者:
Purnima Gupta
a
;
purnimachandni1@gmail.com
;
Rajesh Singh
b
;
singh_rajesh999@outlook.com
;
S. Arumugam
c
;
s.arumugam.klu@gmail.com
关键词:
Domination
;
Point-
set
domination
;
Minimal
point-
set
dominating
set
刊名:AKCE International Journal of Graphs and Combinatorics
出版年:2016
3.
Enumerating
minimal
connected
dominating
set
s 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
set
s
刊名:Theoretical Computer Science
出版年:2016
4.
Ideal theory of infinite directed unions of local quadratic transforms
作者:
William Heinzer
a
;
heinzer@purdue.edu
;
K. Alan Loper
b
;
lopera@math.ohio-state.edu
;
Bruce Olberding
c
;
olberdin@nmsu.edu
;
Hans Schoutens
d
;
hschoutens@citytech.cuny.edu
;
Matthew Toeniskoetter
a
;
mtoenisk@purdue.edu
关键词:
13H05
;
13A15
;
13A18
刊名:Journal of Algebra
出版年:2017
5.
Enumerating
minimal
dominating
set
s in chordal bipartite graphs
作者:
Petr A. Golovach
a
;
petr.golovach@ii.uib.no" class="auth_mail" title="E-mail the corresponding author
;
Pinar Heggernes
a
;
pinar.heggernes@ii.uib.no" class="auth_mail" title="E-mail the corresponding author
;
Mamadou M. Kanté
;
b
;
mamadou.kante@isima.fr" class="auth_mail" title="E-mail the corresponding author
;
Dieter Kratsch
c
;
kratsch@univ-metz.fr" class="auth_mail" title="E-mail the corresponding author
;
Yngve Villanger
a
;
yngve.villanger@ii.uib.no" class="auth_mail" title="E-mail the corresponding author
关键词:
Minimal
dominating
set
;
Enumeration
;
Output polynomial algorithm
刊名:Discrete Applied Mathematics
出版年:2016
6.
Enumerating
minimal
dominating
set
s in chordal graphs
作者:
Faisal N. Abu-Khzam
a
;
b
;
faisal.abukhzam@lau.edu.lb" class="auth_mail" title="E-mail the corresponding author
;
Pinar Heggernes
c
;
Pinar.Heggernes@uib.no" class="auth_mail" title="E-mail the corresponding author
关键词:
Input sensitive enumeration
;
Branching algorithm
;
Maximum number of
minimal
dominating
set
s
;
Chordal graphs
;
Graph algorithms
刊名:Information Processing Letters
出版年:2016
7.
Revisiting XOR-based network coding for energy efficient broadcasting in mobile ad hoc networks
作者:
Nikolaos Papanikos
npapanik@cse.uoi.gr
;
Evangelos Papapetrou
;
epap@cse.uoi.gr
关键词:
Energy-efficient broadcasting
;
Network coding
;
Mobile ad hoc network
;
XOR-based coding
;
Connected
dominating
set
;
Deterministic broadcasting
刊名:Computer Communications
出版年:2016
8.
Completion and decomposition of hypergraphs into
dominating
set
s of graphs
作者:
Jaume Martí
;
-Farré
;
a
;
1
;
jaume.marti@ma4.upc.edu" class="auth_mail" title="E-mail the corresponding author
;
Mercè
;
Mora
b
;
2
;
merce.mora@upc.edu" class="auth_mail" title="E-mail the corresponding author
;
José
;
Luis Ruiz
b
;
jose.luis.ruiz@upc.edu" class="auth_mail" title="E-mail the corresponding author
关键词:
Graph
;
hypergraph
;
dominating
set
刊名:Electronic Notes in Discrete Mathematics
出版年:2015
9.
Upper Secure Domination Number of a Graph
作者:
S.V. Divya Rashmi
rashmi.divya@gmail.com" class="auth_mail" title="E-mail the corresponding author
关键词:
secure domination
;
secure domination number
;
upper secure domination number
刊名:Electronic Notes in Discrete Mathematics
出版年:2016
10.
Efficient self-stabilizing algorithms for
minimal
total k-
dominating
set
s in graphs
作者:
Yacine Belhoul
a
;
b
;
yacine.belhoul@etu.univ-lyon1.fr" class="auth_mail
;
Saï
;
d Yahiaoui
a
;
b
;
said.yahiaoui@etu.univ-lyon1.fr" class="auth_mail
;
Hamamache Kheddouci
c
;
hamamache.kheddouci@univ-lyon1.fr" class="auth_mail
关键词:
Distributed self-stabilizing algorithms
;
Graph algorithms
;
Minimal
total
dominating
set
;
Minimal
total k-domination
;
k-Tuple total
dominating
set
刊名:Information Processing Letters
出版年:July, 2014
1
2
3
4
5
6
按检索点细分(56)
题名(13)
关键词(11)
文摘(49)
按出版年细分(56)
2027年及以后(3)
2017年(2)
2016年(6)
2015年(2)
2013年(4)
2012年(3)
2011年(3)
2010年(5)
2009年(3)
2008年(3)
2007年(5)
2006年(1)
2005年(2)
2004年(2)
2003年(1)
2002年(1)
2000年(1)
2000年及以前(9)
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
.