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

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

筛选
英文 中文
1-Normal DRA for Insertion Languages 插入语言的标准DRA
International Conference on Theoretical Computer Science and Discrete Mathematics Pub Date : 2016-12-19 DOI: 10.1007/978-3-319-64419-6_2
Abhisek Midya, Lakshmanan Kuppusamy, V. Sumitha, A. Pani
{"title":"1-Normal DRA for Insertion Languages","authors":"Abhisek Midya, Lakshmanan Kuppusamy, V. Sumitha, A. Pani","doi":"10.1007/978-3-319-64419-6_2","DOIUrl":"https://doi.org/10.1007/978-3-319-64419-6_2","url":null,"abstract":"","PeriodicalId":190209,"journal":{"name":"International Conference on Theoretical Computer Science and Discrete Mathematics","volume":"17 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":"125564983","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
On the Complexity of Minimum Cardinality Maximal Uniquely Restricted Matching in Graphs 图中最小基数最大唯一限制匹配的复杂度
International Conference on Theoretical Computer Science and Discrete Mathematics Pub Date : 2016-12-19 DOI: 10.1007/978-3-319-64419-6_29
B. S. Panda, Arti Pandey
{"title":"On the Complexity of Minimum Cardinality Maximal Uniquely Restricted Matching in Graphs","authors":"B. S. Panda, Arti Pandey","doi":"10.1007/978-3-319-64419-6_29","DOIUrl":"https://doi.org/10.1007/978-3-319-64419-6_29","url":null,"abstract":"","PeriodicalId":190209,"journal":{"name":"International Conference on Theoretical Computer Science and Discrete Mathematics","volume":"37 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":"116319813","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
Homometric Number of a Graph and Some Related Concepts 图的同列数及其相关概念
International Conference on Theoretical Computer Science and Discrete Mathematics Pub Date : 2016-12-19 DOI: 10.1007/978-3-319-64419-6_4
V. Anu, S. Lakshmanan
{"title":"Homometric Number of a Graph and Some Related Concepts","authors":"V. Anu, S. Lakshmanan","doi":"10.1007/978-3-319-64419-6_4","DOIUrl":"https://doi.org/10.1007/978-3-319-64419-6_4","url":null,"abstract":"","PeriodicalId":190209,"journal":{"name":"International Conference on Theoretical Computer Science and Discrete Mathematics","volume":"88 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":"116888886","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
Grammar Systems Based on Equal Matrix Rules and Alphabetic Flat Splicing 基于等矩阵规则和字母平面拼接的语法系统
International Conference on Theoretical Computer Science and Discrete Mathematics Pub Date : 2016-12-19 DOI: 10.1007/978-3-319-64419-6_45
G. Samdanielthompson, N. David, K. Subramanian
{"title":"Grammar Systems Based on Equal Matrix Rules and Alphabetic Flat Splicing","authors":"G. Samdanielthompson, N. David, K. Subramanian","doi":"10.1007/978-3-319-64419-6_45","DOIUrl":"https://doi.org/10.1007/978-3-319-64419-6_45","url":null,"abstract":"","PeriodicalId":190209,"journal":{"name":"International Conference on Theoretical Computer Science and Discrete Mathematics","volume":"83 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":"115764676","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
Forbidden Subgraphs of Bigraphs of Ferrers Dimension 2 2维图的禁止子图
International Conference on Theoretical Computer Science and Discrete Mathematics Pub Date : 2016-12-19 DOI: 10.1007/978-3-319-64419-6_5
A. Das, R. Chakraborty
{"title":"Forbidden Subgraphs of Bigraphs of Ferrers Dimension 2","authors":"A. Das, R. Chakraborty","doi":"10.1007/978-3-319-64419-6_5","DOIUrl":"https://doi.org/10.1007/978-3-319-64419-6_5","url":null,"abstract":"","PeriodicalId":190209,"journal":{"name":"International Conference on Theoretical Computer Science and Discrete Mathematics","volume":"82 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":"116068216","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
Upper Majority Domination 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_26
A. Muthuselvi, S. Arumugam
{"title":"Upper Majority Domination Number of a Graph","authors":"A. Muthuselvi, S. Arumugam","doi":"10.1007/978-3-319-64419-6_26","DOIUrl":"https://doi.org/10.1007/978-3-319-64419-6_26","url":null,"abstract":"","PeriodicalId":190209,"journal":{"name":"International Conference on Theoretical Computer Science and Discrete Mathematics","volume":"63 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":"114197537","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
Dominator Colorings of Products of Graphs 图的乘积的支配色
International Conference on Theoretical Computer Science and Discrete Mathematics Pub Date : 2016-12-19 DOI: 10.1007/978-3-319-64419-6_32
P. Paulraja, K. R. Chandrasekar
{"title":"Dominator Colorings of Products of Graphs","authors":"P. Paulraja, K. R. Chandrasekar","doi":"10.1007/978-3-319-64419-6_32","DOIUrl":"https://doi.org/10.1007/978-3-319-64419-6_32","url":null,"abstract":"","PeriodicalId":190209,"journal":{"name":"International Conference on Theoretical Computer Science and Discrete Mathematics","volume":"23 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":"114698560","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
Identification of Salinity Stress Tolerant Proteins in Sorghum Bicolor Computational Approach 高粱双色耐盐胁迫蛋白的鉴定
International Conference on Theoretical Computer Science and Discrete Mathematics Pub Date : 2016-12-19 DOI: 10.1007/978-3-319-64419-6_41
S. Rajeswari, M. Indhumathy, A. Somasundaram, Neeru Sood, S. Arumugam
{"title":"Identification of Salinity Stress Tolerant Proteins in Sorghum Bicolor Computational Approach","authors":"S. Rajeswari, M. Indhumathy, A. Somasundaram, Neeru Sood, S. Arumugam","doi":"10.1007/978-3-319-64419-6_41","DOIUrl":"https://doi.org/10.1007/978-3-319-64419-6_41","url":null,"abstract":"","PeriodicalId":190209,"journal":{"name":"International Conference on Theoretical Computer Science and Discrete Mathematics","volume":"362 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":"120961388","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
Efficient Hybrid Approach for Compression of Multi Modal Medical Images 多模态医学图像压缩的高效混合方法
International Conference on Theoretical Computer Science and Discrete Mathematics Pub Date : 2016-12-19 DOI: 10.1007/978-3-319-64419-6_33
B. Perumal, M. Rajasekaran, T. Prasath
{"title":"Efficient Hybrid Approach for Compression of Multi Modal Medical Images","authors":"B. Perumal, M. Rajasekaran, T. Prasath","doi":"10.1007/978-3-319-64419-6_33","DOIUrl":"https://doi.org/10.1007/978-3-319-64419-6_33","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":"129725330","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 Total Roman Domination in Graphs 论罗马人在图中的统治
International Conference on Theoretical Computer Science and Discrete Mathematics Pub Date : 2016-12-19 DOI: 10.1007/978-3-319-64419-6_42
P. R. L. Pushpam, Padmapriea Sampath
{"title":"On Total Roman Domination in Graphs","authors":"P. R. L. Pushpam, Padmapriea Sampath","doi":"10.1007/978-3-319-64419-6_42","DOIUrl":"https://doi.org/10.1007/978-3-319-64419-6_42","url":null,"abstract":"","PeriodicalId":190209,"journal":{"name":"International Conference on Theoretical Computer Science and Discrete Mathematics","volume":"40 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":"132037240","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}
引用次数: 47
首页 上一页 下一页 尾页
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学术官方微信