搜索页_+Threshold-Minimum+Dominating+Set

设为首页

收藏本站

网站地图 | English | 公务邮箱

About the library

Background
History
Leadership
Organization

Readers' Guide

Opening Hours
Collections
Help Via Email

Publications

Electronic Information Resources

常用资源

在“Elsevier电子期刊”中，命中：7条，耗时：0.0749615 秒

在所有数据库中总计命中：40条

1.Bank supervision using the Threshold-Minimum Dominating Set

作者：Periklis Gogas ; Theophilos Papadimitriou ; Maria-Artemis Matthaiou ; ^{maria.matthaiou7@gmail.com" class="auth_mail" title="E-mail the corresponding author}

关键词：Complex networks ; Minimum Dominating Set ; Banking supervision ; Monitoring optimization

刊名：Physica A: Statistical Mechanics and its Applications

出版年：2016

2.International business cycle synchronization since the 1870s: Evidence from a novel network approach

作者：Nikolaos Antonakakis^a ; ^b ; ^c ; ^d ; ^{nikolaos.antonakakis@port.ac.uk" class="auth_mail" title="E-mail the corresponding author} ; ^{nikolaos.antonakakis@webster.ac.at" class="auth_mail" title="E-mail the corresponding author} ; ^{nikolaos.antonakakis@wu.ac.at" class="auth_mail" title="E-mail the corresponding author} ; Periklis Gogas^e ; ^{pgkogkas@econ.duth.gr" class="auth_mail" title="E-mail the corresponding author} ; Theophilos Papadimitriou^e ; ^{papadimi@econ.duth.gr" class="auth_mail" title="E-mail the corresponding author} ; Georgios Antonios Sarantitis^e ; ^{gsaranti@econ.duth.gr" class="auth_mail" title="E-mail the corresponding author}

关键词：Business cycle synchronization ; Globalization ; Complex networks ; Threshold-Minimum Dominating Set

刊名：Physica A: Statistical Mechanics and its Applications

出版年：2016

3.The k-hop connected dominating set problem: hardness and polyhedra

作者：Rafael S. Coelho ^{rcoelho@ime.usp.br" class="auth_mail" title="E-mail the corresponding author} ; Phablo F.S. Moura ^{phablo@ime.usp.br" class="auth_mail" title="E-mail the corresponding author} ; Yoshiko Wakabayashi ^{yw@ime.usp.br" class="auth_mail" title="E-mail the corresponding author}

关键词：k-hop connected dominating set ; hardness ; polytope ; facets

刊名：Electronic Notes in Discrete Mathematics

出版年：2015

4.Proper connection number and connected dominating sets

作者：Xueliang Li ; ^{lxl@nankai.edu.cn" class="auth_mail" title="E-mail the corresponding author} ; Meiqin Wei ^{weimeiqin8912@163.com" class="auth_mail" title="E-mail the corresponding author} ; Jun Yue ^{yuejun06@126.com" class="auth_mail" title="E-mail the corresponding author}

关键词：Proper connection number ; Proper-path coloring ; Connected dominating set ; Diameter

刊名：Theoretical Computer Science

出版年：2015

5.On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems

作者：Sylvain Guillemot ; Franç ; ois Nicolas ; Vincent Berry ; Christophe Paul

关键词：Computational biology ; Phylogenetics ; Consensus tree ; Approximation algorithm ; Approximation hardness ; Maximum agreement subtree ; Maximum compatible tree ; Maximum refinement subtree ; Complement problem ; Maximum star-forest ; Minimum dominating set ; Maximum

刊名：Discrete Applied Mathematics

出版年：2009

6.Independent sets in extensions of 2K₂-free graphs

作者：Lozin ; Vadim V. ; Mosca ; Raffaele

关键词：Maximal stable set ; Polynomial-time algorithm

刊名：Discrete Applied Mathematics

出版年：2005

7.The Cut Number of the n-Cube, Boolean Methods and a Geometric Connection to Threshold Logic

作者：M.R. Emamy-K.

关键词：graph algorithms ; edge domination ; series parallel graphs

刊名：Electronic Notes in Discrete Mathematics

出版年：2004

按检索点细分(7)

题名(1)

关键词(1)

文摘(4)

按出版年细分(7)

2016年(2)

2015年(2)

2009年(1)

2005年(1)

2004年(1)