发布求助
文献互助 智能选刊 最新文献

International Conference on Theoretical Computer Science and Discrete Mathematics最新文献

筛选
英文 中文
Dominator Coloring of Generalized Petersen Graphs 广义Petersen图的支配子着色
International Conference on Theoretical Computer Science and Discrete Mathematics Pub Date : 2016-12-19 DOI: 10.1007/978-3-319-64419-6_19
J. M. Jeyaseeli, Nazanin Movarraei, S. Arumugam
{"title":"Dominator Coloring of Generalized Petersen Graphs","authors":"J. M. Jeyaseeli, Nazanin Movarraei, S. Arumugam","doi":"10.1007/978-3-319-64419-6_19","DOIUrl":"https://doi.org/10.1007/978-3-319-64419-6_19","url":null,"abstract":"","PeriodicalId":190209,"journal":{"name":"International Conference on Theoretical Computer Science and Discrete Mathematics","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116565887","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
The Median Problem on Symmetric Bipartite Graphs 对称二部图上的中值问题
International Conference on Theoretical Computer Science and Discrete Mathematics Pub Date : 2016-12-19 DOI: 10.1007/978-3-319-64419-6_34
K. Pravas, A. Vijayakumar
{"title":"The Median Problem on Symmetric Bipartite Graphs","authors":"K. Pravas, A. Vijayakumar","doi":"10.1007/978-3-319-64419-6_34","DOIUrl":"https://doi.org/10.1007/978-3-319-64419-6_34","url":null,"abstract":"","PeriodicalId":190209,"journal":{"name":"International Conference on Theoretical Computer Science and Discrete Mathematics","volume":"84 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134238934","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Signed Cycle Domination in Planar Graphs 平面图中的符号循环支配
International Conference on Theoretical Computer Science and Discrete Mathematics Pub Date : 2016-12-19 DOI: 10.1007/978-3-319-64419-6_52
M. Sundarakannan, S. Arumugam
{"title":"Signed Cycle Domination in Planar Graphs","authors":"M. Sundarakannan, S. Arumugam","doi":"10.1007/978-3-319-64419-6_52","DOIUrl":"https://doi.org/10.1007/978-3-319-64419-6_52","url":null,"abstract":"","PeriodicalId":190209,"journal":{"name":"International Conference on Theoretical Computer Science and Discrete Mathematics","volume":"69 31","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132845157","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Point-Set Domination in Graphs. VIII: Perfect and Efficient PSD Sets 图中的点集支配。八:完善和高效的PSD套装
International Conference on Theoretical Computer Science and Discrete Mathematics Pub Date : 2016-12-19 DOI: 10.1007/978-3-319-64419-6_38
Purnima Gupta, Alka Goyal, Rajesh Singh
{"title":"Point-Set Domination in Graphs. VIII: Perfect and Efficient PSD Sets","authors":"Purnima Gupta, Alka Goyal, Rajesh Singh","doi":"10.1007/978-3-319-64419-6_38","DOIUrl":"https://doi.org/10.1007/978-3-319-64419-6_38","url":null,"abstract":"","PeriodicalId":190209,"journal":{"name":"International Conference on Theoretical Computer Science and Discrete Mathematics","volume":"869 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126971991","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Graphoidal Length and Graphoidal Covering Number of a Graph 图的图面长度和图面覆盖数
International Conference on Theoretical Computer Science and Discrete Mathematics Pub Date : 2016-12-19 DOI: 10.1007/978-3-319-64419-6_39
Purnima Gupta, Rajesh Singh, S. Arumugam
{"title":"Graphoidal Length and Graphoidal Covering Number of a Graph","authors":"Purnima Gupta, Rajesh Singh, S. Arumugam","doi":"10.1007/978-3-319-64419-6_39","DOIUrl":"https://doi.org/10.1007/978-3-319-64419-6_39","url":null,"abstract":"","PeriodicalId":190209,"journal":{"name":"International Conference on Theoretical Computer Science and Discrete Mathematics","volume":"57 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120923587","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
On Graphs Whose Graphoidal Length Is Half of Its Size 论图线长度为其大小一半的图
International Conference on Theoretical Computer Science and Discrete Mathematics Pub Date : 2016-12-19 DOI: 10.1007/978-3-319-64419-6_37
Purnima Gupta, Rajesh Singh
{"title":"On Graphs Whose Graphoidal Length Is Half of Its Size","authors":"Purnima Gupta, Rajesh Singh","doi":"10.1007/978-3-319-64419-6_37","DOIUrl":"https://doi.org/10.1007/978-3-319-64419-6_37","url":null,"abstract":"","PeriodicalId":190209,"journal":{"name":"International Conference on Theoretical Computer Science and Discrete Mathematics","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114869473","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An Optimization Algorithm for Task Scheduling in Cloud Computing Based on Multi-Purpose Cuckoo Seek Algorithm 基于多用途布谷鸟寻算法的云计算任务调度优化算法
International Conference on Theoretical Computer Science and Discrete Mathematics Pub Date : 2016-12-19 DOI: 10.1007/978-3-319-64419-6_53
R. Sundarrajan, V. Vasudevan
{"title":"An Optimization Algorithm for Task Scheduling in Cloud Computing Based on Multi-Purpose Cuckoo Seek Algorithm","authors":"R. Sundarrajan, V. Vasudevan","doi":"10.1007/978-3-319-64419-6_53","DOIUrl":"https://doi.org/10.1007/978-3-319-64419-6_53","url":null,"abstract":"","PeriodicalId":190209,"journal":{"name":"International Conference on Theoretical Computer Science and Discrete Mathematics","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122037639","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Some Diameter Notions of the Generalized Mycielskian of a Graph 图的广义Mycielskian的一些直径概念
International Conference on Theoretical Computer Science and Discrete Mathematics Pub Date : 2016-12-19 DOI: 10.1007/978-3-319-64419-6_48
K. Savitha, M. Chithra, A. Vijayakumar
{"title":"Some Diameter Notions of the Generalized Mycielskian of a Graph","authors":"K. Savitha, M. Chithra, A. Vijayakumar","doi":"10.1007/978-3-319-64419-6_48","DOIUrl":"https://doi.org/10.1007/978-3-319-64419-6_48","url":null,"abstract":"","PeriodicalId":190209,"journal":{"name":"International Conference on Theoretical Computer Science and Discrete Mathematics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131248474","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A Stream Cipher for Real Time Applications 用于实时应用的流密码
International Conference on Theoretical Computer Science and Discrete Mathematics Pub Date : 2016-12-19 DOI: 10.1007/978-3-319-64419-6_57
M. Venkatesulu, M. Ravi
{"title":"A Stream Cipher for Real Time Applications","authors":"M. Venkatesulu, M. Ravi","doi":"10.1007/978-3-319-64419-6_57","DOIUrl":"https://doi.org/10.1007/978-3-319-64419-6_57","url":null,"abstract":"","PeriodicalId":190209,"journal":{"name":"International Conference on Theoretical Computer Science and Discrete Mathematics","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115059169","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
The Distinguishing Number of Kronecker Product of Two Graphs 两个图的Kronecker积的区别数
International Conference on Theoretical Computer Science and Discrete Mathematics Pub Date : 2016-12-19 DOI: 10.1007/978-3-319-64419-6_44
S. Alikhani, S. Soltani
{"title":"The Distinguishing Number of Kronecker Product of Two Graphs","authors":"S. Alikhani, S. Soltani","doi":"10.1007/978-3-319-64419-6_44","DOIUrl":"https://doi.org/10.1007/978-3-319-64419-6_44","url":null,"abstract":"","PeriodicalId":190209,"journal":{"name":"International Conference on Theoretical Computer Science and Discrete Mathematics","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128377193","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信