Pub Date : 2022-09-01DOI: 10.1016/j.tcs.2022.09.024
Ran Gu, G. Gutin, Shasha Li, Yongtang Shi, Z. Taoqiu
{"title":"Smallest number of vertices in a 2-arc-strong digraph without good pairs","authors":"Ran Gu, G. Gutin, Shasha Li, Yongtang Shi, Z. Taoqiu","doi":"10.1016/j.tcs.2022.09.024","DOIUrl":"https://doi.org/10.1016/j.tcs.2022.09.024","url":null,"abstract":"","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"102 1","pages":"148-171"},"PeriodicalIF":0.0,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90650705","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}
Pub Date : 2022-09-01DOI: 10.1016/j.tcs.2022.08.015
F. Gadducci, Timo Kehrer
{"title":"Special issue on Theoretical Topics in Graph Transformation","authors":"F. Gadducci, Timo Kehrer","doi":"10.1016/j.tcs.2022.08.015","DOIUrl":"https://doi.org/10.1016/j.tcs.2022.08.015","url":null,"abstract":"","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"18 1","pages":"155-156"},"PeriodicalIF":0.0,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89905123","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}
Pub Date : 2022-08-29DOI: 10.48550/arXiv.2208.13615
M. Bekos, G. D. Lozzo, Fabrizio Frati, Martin Gronemann, T. Mchedlidze, Chrysanthi N. Raftopoulou
The page-number of a directed acyclic graph (a DAG, for short) is the minimum $k$ for which the DAG has a topological order and a $k$-coloring of its edges such that no two edges of the same color cross, i.e., have alternating endpoints along the topological order. In 1999, Heath and Pemmaraju conjectured that the recognition of DAGs with page-number $2$ is NP-complete and proved that recognizing DAGs with page-number $6$ is NP-complete [SIAM J. Computing, 1999]. Binucci et al. recently strengthened this result by proving that recognizing DAGs with page-number $k$ is NP-complete, for every $kgeq 3$ [SoCG 2019]. In this paper, we finally resolve Heath and Pemmaraju's conjecture in the affirmative. In particular, our NP-completeness result holds even for $st$-planar graphs and planar posets.
有向无环图(简称DAG)的页码是最小值$k$，对于该DAG具有拓扑顺序和其边的$k$ -着色，使得没有相同颜色的两条边交叉，即沿拓扑顺序有交替的端点。1999年，Heath和Pemmaraju推测对页码为$2$的dag的识别是np完全的，并证明对页码为$6$的dag的识别是np完全的[SIAM J. Computing, 1999]。Binucci等人最近通过证明对于每个$kgeq 3$，识别页码为$k$的DAGs是np完全的，从而加强了这一结果[SoCG 2019]。本文最终肯定地解决了Heath和Pemmaraju的猜想。特别地，我们的np完备性结果甚至适用于$st$ -平面图和面序集。
{"title":"Recognizing DAGs with Page-Number 2 is NP-complete","authors":"M. Bekos, G. D. Lozzo, Fabrizio Frati, Martin Gronemann, T. Mchedlidze, Chrysanthi N. Raftopoulou","doi":"10.48550/arXiv.2208.13615","DOIUrl":"https://doi.org/10.48550/arXiv.2208.13615","url":null,"abstract":"The page-number of a directed acyclic graph (a DAG, for short) is the minimum $k$ for which the DAG has a topological order and a $k$-coloring of its edges such that no two edges of the same color cross, i.e., have alternating endpoints along the topological order. In 1999, Heath and Pemmaraju conjectured that the recognition of DAGs with page-number $2$ is NP-complete and proved that recognizing DAGs with page-number $6$ is NP-complete [SIAM J. Computing, 1999]. Binucci et al. recently strengthened this result by proving that recognizing DAGs with page-number $k$ is NP-complete, for every $kgeq 3$ [SoCG 2019]. In this paper, we finally resolve Heath and Pemmaraju's conjecture in the affirmative. In particular, our NP-completeness result holds even for $st$-planar graphs and planar posets.","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"27 1","pages":"113689"},"PeriodicalIF":0.0,"publicationDate":"2022-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85133956","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}
Pub Date : 2022-08-24DOI: 10.48550/arXiv.2208.11237
Samuel Epstein
We prove a Kolmogorov complexity variant of the birthday paradox. Sufficiently sized random subsets of strings are guaranteed to have two members x and y with low K(x/y). To prove this, we first show that the minimum conditional Kolmogorov complexity between members of finite sets is very low if they are not exotic. Exotic sets have high mutual information with the halting sequence.
{"title":"The Kolmogorov Birthday Paradox","authors":"Samuel Epstein","doi":"10.48550/arXiv.2208.11237","DOIUrl":"https://doi.org/10.48550/arXiv.2208.11237","url":null,"abstract":"We prove a Kolmogorov complexity variant of the birthday paradox. Sufficiently sized random subsets of strings are guaranteed to have two members x and y with low K(x/y). To prove this, we first show that the minimum conditional Kolmogorov complexity between members of finite sets is very low if they are not exotic. Exotic sets have high mutual information with the halting sequence.","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"19 1","pages":"113964"},"PeriodicalIF":0.0,"publicationDate":"2022-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87457373","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}
Pub Date : 2022-08-17DOI: 10.48550/arXiv.2208.08021
Shaojie Tang, Jing Yuan
Many sequential decision making problems can be formulated as an adaptive submodular maximization problem. However, most of existing studies in this field focus on pool-based setting, where one can pick items in any order, and there have been few studies for the stream-based setting where items arrive in an arbitrary order and one must immediately decide whether to select an item or not upon its arrival. In this paper, we introduce a new class of utility functions, semi-policywise submodular functions. We develop a series of effective algorithms to maximize a semi-policywise submodular function under the stream-based setting.
{"title":"Streaming Adaptive Submodular Maximization","authors":"Shaojie Tang, Jing Yuan","doi":"10.48550/arXiv.2208.08021","DOIUrl":"https://doi.org/10.48550/arXiv.2208.08021","url":null,"abstract":"Many sequential decision making problems can be formulated as an adaptive submodular maximization problem. However, most of existing studies in this field focus on pool-based setting, where one can pick items in any order, and there have been few studies for the stream-based setting where items arrive in an arbitrary order and one must immediately decide whether to select an item or not upon its arrival. In this paper, we introduce a new class of utility functions, semi-policywise submodular functions. We develop a series of effective algorithms to maximize a semi-policywise submodular function under the stream-based setting.","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"6 1","pages":"113644"},"PeriodicalIF":0.0,"publicationDate":"2022-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73024799","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}
Pub Date : 2022-08-01DOI: 10.1016/j.tcs.2022.07.037
S. K. Narayanan, S. Dhanasekaran, V. Vasudevan
{"title":"An effective parameter tuned deep belief network for detecting anomalous behavior in sensor-based cyber-physical systems","authors":"S. K. Narayanan, S. Dhanasekaran, V. Vasudevan","doi":"10.1016/j.tcs.2022.07.037","DOIUrl":"https://doi.org/10.1016/j.tcs.2022.07.037","url":null,"abstract":"","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"57 5 1","pages":"142-151"},"PeriodicalIF":0.0,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77750780","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}
Pub Date : 2022-08-01DOI: 10.1016/j.tcs.2022.08.020
Meirun Chen, D. Hsu, Cheng-Kuan Lin
{"title":"A new structure for a vertex to be locally t-diagnosable in large multiprocessor systems","authors":"Meirun Chen, D. Hsu, Cheng-Kuan Lin","doi":"10.1016/j.tcs.2022.08.020","DOIUrl":"https://doi.org/10.1016/j.tcs.2022.08.020","url":null,"abstract":"","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"47 1","pages":"81-90"},"PeriodicalIF":0.0,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74804429","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}
Pub Date : 2022-08-01DOI: 10.1016/j.tcs.2022.08.011
Y. Asahiro, I. Suzuki, M. Yamashita
{"title":"Monotonic self-stabilization and its application to robust and adaptive pattern formation","authors":"Y. Asahiro, I. Suzuki, M. Yamashita","doi":"10.1016/j.tcs.2022.08.011","DOIUrl":"https://doi.org/10.1016/j.tcs.2022.08.011","url":null,"abstract":"","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"31 1","pages":"21-46"},"PeriodicalIF":0.0,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90364347","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：