{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:16:28Z","timestamp":1753884988489,"version":"3.41.2"},"reference-count":38,"publisher":"World Scientific Pub Co Pte Ltd","issue":"04","funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-19-1-0177"],"award-info":[{"award-number":["FA9550-19-1-0177"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2023,5]]},"abstract":"<jats:p> In this paper, we present two new graph structures that can be used to model information routing in heterogeneous communication networks. These are cardinality-constrained graphs (CCGs) and interval-constrained graphs (ICGs). In both cardinality- and interval-constrained graphs, the nodes in the graph are labeled. In a CCG, each label is associated with an upper bound. A path in a CCG is considered valid, if the number of nodes on the path with any particular label is at most the upper bound associated with that label. In an ICG, each label is associated with both an upper bound and a lower bound. A path in an ICG is considered valid, if the number of nodes on the path with any particular label is between the upper and lower bounds associated with that label. In this paper, we examine the computational complexities of finding valid paths in both CCGs and ICGs. In particular, we show that these problems are NP-hard. Additionally, we propose novel algorithms for finding paths in CCGs and a subset of ICGs. We also demonstrate the effectiveness of our algorithms on CCGs and ICGs of various sizes. The past decade has seen a surge in the degree of hardware-heterogeneous device interconnectivity, Additionally, there has been a proliferation of resource-constrained wireless sensor networks. Thus, the problems of finding valid paths in CCGs and ICGs are of interest. Nodes in wireless sensor networks can be faulty, vulnerable, energy-constrained, or untrusted. These nodes may also have differing degrees of performance or power efficiency. This can pose a significant challenge in routing the flow of information between nodes. The heterogeneity of nodes in such networks is captured through the use of CCGs and ICGs. <\/jats:p>","DOI":"10.1142\/s1793830922501105","type":"journal-article","created":{"date-parts":[[2022,4,28]],"date-time":"2022-04-28T09:43:54Z","timestamp":1651139034000},"source":"Crossref","is-referenced-by-count":0,"title":["Reachability problems in interval-constrained and cardinality-constrained graphs"],"prefix":"10.1142","volume":"15","author":[{"given":"Alvaro","family":"Velasquez","sequence":"first","affiliation":[{"name":"Information Directorate, Air Force Research Laboratory, Rome, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5821-5117","authenticated-orcid":false,"given":"K.","family":"Subramani","sequence":"additional","affiliation":[{"name":"LDCSEE Department, West Virginia University, Morgantown, WV, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Wojciechowski","sequence":"additional","affiliation":[{"name":"LDCSEE Department, West Virginia University, Morgantown, WV, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2022,6,11]]},"reference":[{"issue":"4","key":"S1793830922501105BIB001","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1016\/j.compeleceng.2008.11.008","volume":"36","author":"Amri H. A.","year":"2010","journal-title":"Comput. Elect. Eng."},{"issue":"6","key":"S1793830922501105BIB002","doi-asserted-by":"crossref","first-page":"1190","DOI":"10.1109\/TSMCC.2012.2189204","volume":"42","author":"Alam M. R.","year":"2012","journal-title":"IEEE Trans. Systems, Man, Cybernetics, Part C"},{"key":"S1793830922501105BIB003","first-page":"97","volume-title":"Scandinavian Workshop on Algorithm Theory","author":"Alber J.","year":"2000"},{"issue":"3","key":"S1793830922501105BIB004","first-page":"829","volume":"3","author":"Altayeb M.","year":"2013","journal-title":"Int. J. Innovation Appl. Studies"},{"key":"S1793830922501105BIB005","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1145\/2380718.2380723","volume-title":"Proc. 4th Annual ACM Web Science Conference","author":"Backstrom L.","year":"2012"},{"issue":"3","key":"S1793830922501105BIB006","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0020-0190(97)00213-5","volume":"65","author":"Balasubramanian R.","year":"1998","journal-title":"Inf. Process. Lett."},{"volume-title":"Workshop on Algorithmic Aspects of Communication","year":"1997","author":"Basagni S.","key":"S1793830922501105BIB007"},{"key":"S1793830922501105BIB008","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/JNS2.2012.6249244","volume-title":"2012 National Days of Network Security and Systems","author":"Blilat A.","year":"2012"},{"key":"S1793830922501105BIB009","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/j.jbi.2015.04.007","volume":"55","author":"Camara C.","year":"2015","journal-title":"J. Biomed. Inf."},{"key":"S1793830922501105BIB010","doi-asserted-by":"crossref","DOI":"10.4324\/9780203137680","volume-title":"Beyond Smart Cities: How Cities Network, Learn and Innovate","author":"Campbell T.","year":"2013"},{"issue":"10","key":"S1793830922501105BIB011","doi-asserted-by":"crossref","first-page":"1416","DOI":"10.1002\/dac.2404","volume":"27","author":"Chen Y.-S.","year":"2014","journal-title":"Int. J. Commun. Syst."},{"volume-title":"Parameterized Complexity","year":"2012","author":"Downey R. G.","key":"S1793830922501105BIB013"},{"issue":"5","key":"S1793830922501105BIB014","doi-asserted-by":"crossref","first-page":"2065","DOI":"10.1109\/TNET.2020.3008630","volume":"28","author":"El Alaoui S.","year":"2020","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"5","key":"S1793830922501105BIB015","doi-asserted-by":"crossref","first-page":"056110","DOI":"10.1103\/PhysRevE.70.056110","volume":"70","author":"Fronczak A.","year":"2004","journal-title":"Phys. Rev. E"},{"issue":"6","key":"S1793830922501105BIB016","doi-asserted-by":"crossref","first-page":"2643","DOI":"10.1109\/TNET.2020.3017792","volume":"28","author":"Gao L.","year":"2020","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"1","key":"S1793830922501105BIB017","first-page":"41","volume":"6","author":"Goldner A","year":"1975","journal-title":"Bull. Malaysian Math. Soc."},{"key":"S1793830922501105BIB018","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1109\/MWCN.2002.1045790","volume-title":"4th Int. Workshop on Mobile and Wireless Communications Network","author":"Handy M. J.","year":"2002"},{"key":"S1793830922501105BIB019","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/j.comnet.2018.11.025","volume":"148","author":"Haslina Hassan W.","year":"2019","journal-title":"Comput. Netw."},{"key":"S1793830922501105BIB020","first-page":"457","volume-title":"Proc. 22nd Int. Conf. Distributed Computing Systems","author":"Intanagonwiwat C.","year":"2002"},{"key":"S1793830922501105BIB021","first-page":"1","volume":"4728","author":"Johnson D. B.","year":"2007","journal-title":"RFC"},{"key":"S1793830922501105BIB022","first-page":"93","volume-title":"Proc. 6th Int. Conf. Internet of Things","author":"Kolcun R.","year":"2016"},{"issue":"1","key":"S1793830922501105BIB023","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2898361","volume":"8","author":"Leskovec J.","year":"2016","journal-title":"ACM Trans. Intell. Syst. Technol."},{"issue":"5","key":"S1793830922501105BIB024","doi-asserted-by":"crossref","first-page":"2132","DOI":"10.1109\/TNET.2020.3007842","volume":"28","author":"Liu Q.","year":"2020","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"S1793830922501105BIB025","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.comnet.2014.12.016","volume":"79","author":"Adeel Mahmood M.","year":"2015","journal-title":"Comput. Netw."},{"issue":"4","key":"S1793830922501105BIB026","doi-asserted-by":"crossref","first-page":"1140","DOI":"10.1109\/TPDS.2013.138","volume":"26","author":"Mahmoud M. M. E. A.","year":"2015","journal-title":"IEEE Trans. Parallel distrib. Syst."},{"key":"S1793830922501105BIB027","doi-asserted-by":"crossref","first-page":"100292","DOI":"10.1016\/j.vehcom.2020.100292","author":"Mershad K.","year":"2020","journal-title":"Vehicular Commun."},{"volume-title":"The Internet of things: How smart TVs, smart cars, smart homes, and smart cities are changing the world","year":"2015","author":"Miller M.","key":"S1793830922501105BIB028"},{"issue":"5","key":"S1793830922501105BIB029","doi-asserted-by":"crossref","first-page":"1981","DOI":"10.1109\/TNET.2020.3004550","volume":"28","author":"Derogarian Miyandoab F.","year":"2020","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"2","key":"S1793830922501105BIB030","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF01193336","volume":"1","author":"Murthy S.","year":"1996","journal-title":"Mobile Netw. Appl."},{"issue":"7","key":"S1793830922501105BIB031","first-page":"22","volume":"83","author":"Narla S. R. K.","year":"2013","journal-title":"Inst. Transp. Eng. ITE J."},{"key":"S1793830922501105BIB032","first-page":"1","volume":"3561","author":"Perkins C. E.","year":"2003","journal-title":"RFC"},{"issue":"3","key":"S1793830922501105BIB033","doi-asserted-by":"crossref","first-page":"1040","DOI":"10.1109\/TIFS.2012.2189568","volume":"7","author":"Roy S.","year":"2012","journal-title":"IEEE Trans. Inf. Forensics Security"},{"volume-title":"Handbook of Satisfiability","year":"2009","author":"Samer M.","key":"S1793830922501105BIB034"},{"key":"S1793830922501105BIB036","doi-asserted-by":"crossref","DOI":"10.1201\/b11309","volume-title":"Delay Tolerant Networks: Protocols and Applications","author":"Vasilakos A. V.","year":"2016"},{"key":"S1793830922501105BIB037","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1109\/NCA.2016.7778606","volume-title":"2016 IEEE 15th Int. Symp. Network Computing and Applications (NCA)","author":"Velasquez A.","year":"2016"},{"key":"S1793830922501105BIB038","first-page":"126","volume-title":"5th IEEE Int. Symp. Network Computing and Applications, NCA 2016","author":"Velasquez A.","year":"2016"},{"key":"S1793830922501105BIB039","first-page":"270","volume-title":"Proc. 5th Int. Conf. Automotive User Interfaces and Interactive Vehicular Applications","author":"Weidl G.","year":"2013"},{"issue":"10","key":"S1793830922501105BIB040","doi-asserted-by":"crossref","first-page":"11771","DOI":"10.1109\/TVT.2020.3018300","volume":"69","author":"Xu C.","year":"2020","journal-title":"IEEE Trans. Vehicular Technol."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830922501105","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,30]],"date-time":"2023-04-30T10:36:14Z","timestamp":1682850974000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830922501105"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,11]]},"references-count":38,"journal-issue":{"issue":"04","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["10.1142\/S1793830922501105"],"URL":"https:\/\/doi.org\/10.1142\/s1793830922501105","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2022,6,11]]},"article-number":"2250110"}}