{"id":"https://openalex.org/W4225014282","doi":"https://doi.org/10.1142/s1793830922501105","title":"Reachability problems in interval-constrained and cardinality-constrained graphs","display_name":"Reachability problems in interval-constrained and cardinality-constrained graphs","publication_year":2022,"publication_date":"2022-04-28","ids":{"openalex":"https://openalex.org/W4225014282","doi":"https://doi.org/10.1142/s1793830922501105"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830922501105","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830922501105","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5067109059","display_name":"Alvaro Velasquez","orcid":"https://orcid.org/0000-0001-6757-105X"},"institutions":[{"id":"https://openalex.org/I1280414376","display_name":"United States Air Force Research Laboratory","ror":"https://ror.org/02e2egq70","country_code":"US","type":"facility","lineage":["https://openalex.org/I1280414376","https://openalex.org/I1330347796","https://openalex.org/I4210102105","https://openalex.org/I4389425425"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alvaro Velasquez","raw_affiliation_strings":["Information Directorate, Air Force Research Laboratory, Rome, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Information Directorate, Air Force Research Laboratory, Rome, NY, USA","institution_ids":["https://openalex.org/I1280414376"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050337397","display_name":"K. Subramani","orcid":"https://orcid.org/0000-0001-5821-5117"},"institutions":[{"id":"https://openalex.org/I12097938","display_name":"West Virginia University","ror":"https://ror.org/011vxgd24","country_code":"US","type":"education","lineage":["https://openalex.org/I12097938"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"K. Subramani","raw_affiliation_strings":["LDCSEE Department, West Virginia University, Morgantown, WV, USA"],"raw_orcid":"https://orcid.org/0000-0001-5821-5117","affiliations":[{"raw_affiliation_string":"LDCSEE Department, West Virginia University, Morgantown, WV, USA","institution_ids":["https://openalex.org/I12097938"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072083212","display_name":"Piotr Wojciechowski","orcid":"https://orcid.org/0000-0003-1684-1077"},"institutions":[{"id":"https://openalex.org/I12097938","display_name":"West Virginia University","ror":"https://ror.org/011vxgd24","country_code":"US","type":"education","lineage":["https://openalex.org/I12097938"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Piotr Wojciechowski","raw_affiliation_strings":["LDCSEE Department, West Virginia University, Morgantown, WV, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LDCSEE Department, West Virginia University, Morgantown, WV, USA","institution_ids":["https://openalex.org/I12097938"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5050337397"],"corresponding_institution_ids":["https://openalex.org/I12097938"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.04051257,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"15","issue":"04","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7144708633422852},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6157389879226685},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.5093728303909302},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.4850549101829529},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4699205160140991},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.45965948700904846},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.44256991147994995},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36409062147140503},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34054410457611084},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23734140396118164},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.23470696806907654},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.16511020064353943}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7144708633422852},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6157389879226685},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.5093728303909302},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.4850549101829529},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4699205160140991},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.45965948700904846},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.44256991147994995},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36409062147140503},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34054410457611084},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23734140396118164},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.23470696806907654},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.16511020064353943},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830922501105","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830922501105","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1198927059","display_name":null,"funder_award_id":"FA9550-19-1-0177","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"}],"funders":[{"id":"https://openalex.org/F4320338279","display_name":"Air Force Office of Scientific Research","ror":"https://ror.org/011e9bt93"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W588247792","https://openalex.org/W1512812209","https://openalex.org/W1972382727","https://openalex.org/W1972577597","https://openalex.org/W1978860163","https://openalex.org/W2002727114","https://openalex.org/W2004735585","https://openalex.org/W2052932666","https://openalex.org/W2055654205","https://openalex.org/W2086687976","https://openalex.org/W2096154913","https://openalex.org/W2099751474","https://openalex.org/W2111023939","https://openalex.org/W2115004400","https://openalex.org/W2469279958","https://openalex.org/W2561491843","https://openalex.org/W2903294440","https://openalex.org/W3041262296","https://openalex.org/W3044855967","https://openalex.org/W3049353060","https://openalex.org/W3080454431","https://openalex.org/W3080597100","https://openalex.org/W3084118240","https://openalex.org/W4206807714","https://openalex.org/W4230245465","https://openalex.org/W4231047191"],"related_works":["https://openalex.org/W3203066795","https://openalex.org/W1917675986","https://openalex.org/W3106476875","https://openalex.org/W2061523528","https://openalex.org/W2073633429","https://openalex.org/W2147848106","https://openalex.org/W4225014282","https://openalex.org/W2740487895","https://openalex.org/W1482993605","https://openalex.org/W120705594"],"abstract_inverted_index":{"In":[0,30,43,84,131,148],"this":[1,132],"paper,":[2,133],"we":[3,134,150,158],"present":[4],"two":[5],"new":[6],"graph":[7,40],"structures":[8],"that":[9,82,129,152],"can":[10,231,251],"be":[11,232],"used":[12],"to":[13],"model":[14],"information":[15,261],"routing":[16,257],"in":[17,38,56,102,143,165,194,219,227,256,268],"heterogeneous":[18],"communication":[19],"networks.":[20,211],"These":[21,238],"are":[22,41,155,223],"cardinality-constrained":[23],"graphs":[24,28],"(CCGs)":[25],"and":[26,33,96,124,146,167,182,221,278],"interval-constrained":[27,34],"(ICGs).":[29],"both":[31,92,144],"cardinality-":[32],"graphs,":[35],"the":[36,39,63,68,77,109,114,122,136,175,195,213,258,274],"nodes":[37,66,112,239,267],"labeled.":[42],"a":[44,57,97,168,192,205,253],"CCG,":[45],"each":[46,87],"label":[47,73,88,119],"is":[48,59,74,89,105,120,271],"associated":[49,80,90,127],"with":[50,70,81,91,116,128],"an":[51,85,93,103],"upper":[52,78,94,123],"bound.":[53,99],"A":[54,100],"path":[55,69,101,115],"CCG":[58],"considered":[60,106],"valid,":[61,107],"if":[62,108],"number":[64,110],"of":[65,111,139,170,177,184,197,207,215,224,245,260,266,276],"on":[67,113,180],"any":[71,117],"particular":[72,118],"at":[75],"most":[76],"bound":[79,95],"label.":[83,130],"ICG,":[86],"lower":[98,125],"ICG":[104],"between":[121,262],"bounds":[126],"examine":[135],"computational":[137],"complexities":[138],"finding":[140,163,216],"valid":[141,217],"paths":[142,164,218],"CCGs":[145,166,181,220,277],"ICGs.":[147,171,279],"particular,":[149],"show":[151],"these":[153],"problems":[154,214],"NP-hard.":[156],"Additionally,":[157,201],"propose":[159],"novel":[160],"algorithms":[161,179],"for":[162],"subset":[169],"We":[172],"also":[173,241],"demonstrate":[174],"effectiveness":[176],"our":[178],"ICGs":[183,222],"various":[185],"sizes.":[186],"The":[187,264],"past":[188],"decade":[189],"has":[190,203],"seen":[191],"surge":[193],"degree":[196],"hardware-heterogeneous":[198],"device":[199],"interconnectivity,":[200],"there":[202],"been":[204],"proliferation":[206],"resource-constrained":[208],"wireless":[209,228],"sensor":[210,229],"Thus,":[212],"interest.":[225],"Nodes":[226],"networks":[230,270],"faulty,":[233],"vulnerable,":[234],"energy-constrained,":[235],"or":[236,247],"untrusted.":[237],"may":[240],"have":[242],"differing":[243],"degrees":[244],"performance":[246],"power":[248],"efficiency.":[249],"This":[250],"pose":[252],"significant":[254],"challenge":[255],"flow":[259],"nodes.":[263],"heterogeneity":[265],"such":[269],"captured":[272],"through":[273],"use":[275]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}