设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
CNKI学位论文(98)
知网期刊论文(15)
在“
Elsevier电子期刊
”中,
命中:
41
条,耗时:0.1019496 秒
在所有数据库中总计命中:
113
条
1.
Maximal-clique partitions and the Roller Coaster Conjecture
作者:
Jonathan Cutler
a
;
1
;
jonathan.cutler@montclair.edu" class="auth_mail" title="E-mail the corresponding author
;
Luke Pebody
b
;
luke@pebody.org" class="auth_mail" title="E-mail the corresponding author
关键词:
Independence polynomial
;
Well
-
covered
graphs
;
Clique coverings
刊名:Journal of Combinatorial Theory, Series A
出版年:2017
2.
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
3.
Analyzing the effect of the forces exerted on cantilever probe tip of atomic force microscope with tapering-shaped geometry and double piezoelectric extended layers in the air and liquid environments
作者:
Moharam Habibnejad Korayem
a
;
Hkorayem@iust.ac.ir" class="auth_mail" title="E-mail the corresponding author
;
Amir Nahavandi
b
刊名:Journal of Sound and Vibration
出版年:2017
4.
Maximal assortative matching for complex network
graphs
作者:
Natarajan Meghanathan
natarajan.meghanathan@jsums.edu" class="auth_mail" title="E-mail the corresponding author
关键词:
Maximal matching
;
Assortative matching
;
Dissortative matching
;
Assortativity index
;
Complex networks
;
Node similarity
刊名:Journal of King Saud University - Computer and Information Sciences
出版年:2016
5.
Crowns in bipartite
graphs
作者:
Vadim E. Levit
levitv@ariel.ac.il" class="auth_mail" title="E-mail the corresponding author
关键词:
maximum matching
;
bipartite graph
;
Kö
;
nig-Egervá
;
ry graph
;
crown
;
order of a crown
;
local maximum stable set
刊名:Electronic Notes in Discrete Mathematics
出版年:2016
6.
Equistable simplicial, very
well
-
covered
, and line
graphs
作者:
Vadim E. Levit
;
Martin Milani膷
关键词:
Equistable graph
;
Simplicial graph
;
Very
well
-
covered
graph
;
Line graph
;
Strongly equistable graph
;
General partition graph
;
Triangle graph
;
Triangle condition
;
Polynomial time algorithm
刊名:Discrete Applied Mathematics
出版年:11 March, 2014
7.
Extending Berge¡¯s and Favaron¡¯s results about
well
-
covered
graphs
作者:
M¨¢rcia R. Cappelle
;
Dieter Rautenbach
关键词:
Well
-
covered
graph
;
Maximal independent set
刊名:Discrete Mathematics
出版年:2013
8.
Learning dependency-based change impact predictors using independent change histories
作者:
Hani Abdeen
;
hani.abdeen@gmail.com" class="auth_mail" title="E-mail the corresponding author
;
abdeenha@iro.umontreal.ca" class="auth_mail" title="E-mail the corresponding author
;
Khaled Bali
balikhal@iro.umontreal.ca" class="auth_mail" title="E-mail the corresponding author
;
Houari Sahraoui
;
sahraouh@iro.umontreal.ca" class="auth_mail" title="E-mail the corresponding author
;
Bruno Dufour
dufour@iro.umontreal.ca" class="auth_mail" title="E-mail the corresponding author
关键词:
Change impact analysis
;
Impact set prediction
;
Change history analysis
;
Change impact graph
;
Software maintenance
刊名:Information and Software Technology
出版年:2015
9.
On CIS circulants
作者:
Endre Boros
;
Vladimir Gurvich
;
Martin Milani膷
关键词:
Circulant
;
CIS graph
;
Well
-
covered
graph
;
Maximal stable set
;
Maximum stable set
;
Maximal clique
;
Maximum clique
刊名:Discrete Mathematics
出版年:6 March, 2014
10.
On relating edges in
graphs
without cycles of length 4
作者:
Vadim E. Levit
;
levitv@ariel.ac.il" class="auth_mail
;
David Tankus
davidta@ariel.ac.il" class="auth_mail
关键词:
Well
-
covered
graph
;
Relating edge
;
Ford and Fulkerson algorithm
;
SAT problem
刊名:Journal of Discrete Algorithms
出版年:May 2014
1
2
3
4
5
按检索点细分(41)
题名(18)
关键词(3)
文摘(35)
按出版年细分(41)
2027年及以后(3)
2017年(3)
2016年(2)
2015年(1)
2013年(2)
2012年(4)
2011年(4)
2009年(2)
2008年(2)
2007年(2)
2006年(2)
2004年(1)
2003年(1)
2001年(1)
2000年(3)
2000年及以前(8)
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
.