稀疏随机图中支配数的估计及其应用

Proceedings of the Fifth European Conference on the Engineering of Computer-Based Systems Pub Date : 2017-08-31 DOI:10.1145/3123779.3123801

Martin Nehéz, Dusan Bernát, M. Lelovský

{"title":"稀疏随机图中支配数的估计及其应用","authors":"Martin Nehéz, Dusan Bernát, M. Lelovský","doi":"10.1145/3123779.3123801","DOIUrl":null,"url":null,"abstract":"Motivated by airborne intruder detection and defence systems, we examine sparse random graphs with linear number of connections. We establish theoretical bounds on domination number and our analysis gives a partial solution of the problem posed in [6]. Our computer simulations are based on the integer linear programming optimization method. The experimental results verify our analytical estimations and suggest a direction for the future research.","PeriodicalId":405980,"journal":{"name":"Proceedings of the Fifth European Conference on the Engineering of Computer-Based Systems","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Estimation of the domination number in sparse random graphs and applications\",\"authors\":\"Martin Nehéz, Dusan Bernát, M. Lelovský\",\"doi\":\"10.1145/3123779.3123801\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Motivated by airborne intruder detection and defence systems, we examine sparse random graphs with linear number of connections. We establish theoretical bounds on domination number and our analysis gives a partial solution of the problem posed in [6]. Our computer simulations are based on the integer linear programming optimization method. The experimental results verify our analytical estimations and suggest a direction for the future research.\",\"PeriodicalId\":405980,\"journal\":{\"name\":\"Proceedings of the Fifth European Conference on the Engineering of Computer-Based Systems\",\"volume\":\"52 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-08-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Fifth European Conference on the Engineering of Computer-Based Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3123779.3123801\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Fifth European Conference on the Engineering of Computer-Based Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3123779.3123801","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

在机载入侵检测和防御系统的激励下，我们研究了具有线性连接数的稀疏随机图。我们建立了支配数的理论界限，我们的分析给出了[6]中提出的问题的部分解。我们的计算机模拟是基于整数线性规划优化方法。实验结果验证了我们的分析估计，并为今后的研究指明了方向。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Estimation of the domination number in sparse random graphs and applications

Motivated by airborne intruder detection and defence systems, we examine sparse random graphs with linear number of connections. We establish theoretical bounds on domination number and our analysis gives a partial solution of the problem posed in [6]. Our computer simulations are based on the integer linear programming optimization method. The experimental results verify our analytical estimations and suggest a direction for the future research.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the Fifth European Conference on the Engineering of Computer-Based Systems

自引率

0.00%

发文量