{"id":"https://openalex.org/W4408017170","doi":"https://doi.org/10.1109/tits.2025.3544252","title":"Finding the Maximum Density Path Within Constrained Length in a Graph","display_name":"Finding the Maximum Density Path Within Constrained Length in a Graph","publication_year":2025,"publication_date":"2025-02-27","ids":{"openalex":"https://openalex.org/W4408017170","doi":"https://doi.org/10.1109/tits.2025.3544252"},"language":"en","primary_location":{"id":"doi:10.1109/tits.2025.3544252","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tits.2025.3544252","pdf_url":null,"source":{"id":"https://openalex.org/S144771191","display_name":"IEEE Transactions on Intelligent Transportation Systems","issn_l":"1524-9050","issn":["1524-9050","1558-0016"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Intelligent Transportation Systems","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/A5021698413","display_name":"Detian Zhang","orcid":"https://orcid.org/0000-0002-9476-0937"},"institutions":[{"id":"https://openalex.org/I3923682","display_name":"Soochow University","ror":"https://ror.org/05t8y2r12","country_code":"CN","type":"education","lineage":["https://openalex.org/I3923682"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Detian Zhang","raw_affiliation_strings":["Institute of Artificial Intelligence, Department of Computer Science and Technology, Soochow University, Suzhou, China","Department of Computer Science and Technology, Institute of Artificial Intelligence, Soochow University, Suzhou, China"],"raw_orcid":"https://orcid.org/0000-0002-9476-0937","affiliations":[{"raw_affiliation_string":"Institute of Artificial Intelligence, Department of Computer Science and Technology, Soochow University, Suzhou, China","institution_ids":["https://openalex.org/I3923682"]},{"raw_affiliation_string":"Department of Computer Science and Technology, Institute of Artificial Intelligence, Soochow University, Suzhou, China","institution_ids":["https://openalex.org/I3923682"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016799217","display_name":"Hongwei Tang","orcid":"https://orcid.org/0000-0001-5835-9719"},"institutions":[{"id":"https://openalex.org/I3923682","display_name":"Soochow University","ror":"https://ror.org/05t8y2r12","country_code":"CN","type":"education","lineage":["https://openalex.org/I3923682"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hongwei Tang","raw_affiliation_strings":["Institute of Artificial Intelligence, Department of Computer Science and Technology, Soochow University, Suzhou, China","Department of Computer Science and Technology, Institute of Artificial Intelligence, Soochow University, Suzhou, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Artificial Intelligence, Department of Computer Science and Technology, Soochow University, Suzhou, China","institution_ids":["https://openalex.org/I3923682"]},{"raw_affiliation_string":"Department of Computer Science and Technology, Institute of Artificial Intelligence, Soochow University, Suzhou, China","institution_ids":["https://openalex.org/I3923682"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055242074","display_name":"Chunjiang Zhu","orcid":"https://orcid.org/0000-0002-5227-3575"},"institutions":[{"id":"https://openalex.org/I169335092","display_name":"University of North Carolina at Greensboro","ror":"https://ror.org/04fnxsj42","country_code":"US","type":"education","lineage":["https://openalex.org/I169335092"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chunjiang Zhu","raw_affiliation_strings":["Department of Computer Science, University of North Carolina at Greensboro, Greensboro, NC, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of North Carolina at Greensboro, Greensboro, NC, USA","institution_ids":["https://openalex.org/I169335092"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100404176","display_name":"Qing Li","orcid":"https://orcid.org/0000-0003-3370-471X"},"institutions":[{"id":"https://openalex.org/I14243506","display_name":"Hong Kong Polytechnic University","ror":"https://ror.org/0030zas98","country_code":"HK","type":"education","lineage":["https://openalex.org/I14243506"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Qing Li","raw_affiliation_strings":["Department of Computing, The Hong Kong Polytechnic University, Hong Kong, China"],"raw_orcid":"https://orcid.org/0000-0003-3370-471X","affiliations":[{"raw_affiliation_string":"Department of Computing, The Hong Kong Polytechnic University, Hong Kong, China","institution_ids":["https://openalex.org/I14243506"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5352,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.6346279,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":98},"biblio":{"volume":"26","issue":"6","first_page":"8513","last_page":"8524"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9469000101089478,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9469000101089478,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9052000045776367,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/path","display_name":"Path (computing)","score":0.4874246418476105},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.423595666885376},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.41666314005851746},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4074400067329407},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39341437816619873},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3157895803451538},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07171201705932617}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4874246418476105},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.423595666885376},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.41666314005851746},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4074400067329407},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39341437816619873},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3157895803451538},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07171201705932617}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tits.2025.3544252","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tits.2025.3544252","pdf_url":null,"source":{"id":"https://openalex.org/S144771191","display_name":"IEEE Transactions on Intelligent Transportation Systems","issn_l":"1524-9050","issn":["1524-9050","1558-0016"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Intelligent Transportation Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320327518","display_name":"Priority Academic Program Development of Jiangsu Higher Education Institutions","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W18450336","https://openalex.org/W24716939","https://openalex.org/W1537963461","https://openalex.org/W1976157781","https://openalex.org/W2012473793","https://openalex.org/W2019003829","https://openalex.org/W2036900823","https://openalex.org/W2089783582","https://openalex.org/W2090865599","https://openalex.org/W2105089535","https://openalex.org/W2138622863","https://openalex.org/W2146968241","https://openalex.org/W2157026797","https://openalex.org/W2159176259","https://openalex.org/W2215748439","https://openalex.org/W2408262133","https://openalex.org/W2770729327","https://openalex.org/W2946755901","https://openalex.org/W2950039944","https://openalex.org/W3007023388","https://openalex.org/W3032745867","https://openalex.org/W3037402572","https://openalex.org/W3176638005","https://openalex.org/W3198197820","https://openalex.org/W3214564065","https://openalex.org/W4252639262","https://openalex.org/W4321485465","https://openalex.org/W6735910640"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027","https://openalex.org/W2962838298","https://openalex.org/W2600246793"],"abstract_inverted_index":{"Most":[0],"of":[1,71,79,90,127,165],"existing":[2,96],"path":[3,10,30,37,59,73,81,85],"finding":[4,31],"problems":[5],"focused":[6],"on":[7,47,100,154],"searching":[8],"a":[9,28,41,64],"with":[11,43],"the":[12,50,56,69,72,77,80,84,88,105,118,123,128,140,145,161,166],"minimum":[13],"cost,":[14],"such":[15],"as":[16,76],"shortest-path":[17],"length":[18,44,66],"and":[19,45,144,157,163],"shortest":[20],"travel":[21],"time.":[22],"In":[23],"this":[24,101],"paper,":[25],"we":[26,110,132],"consider":[27],"new":[29],"problem,":[32],"i.e.,":[33,139],"length-constrained":[34],"maximum":[35,57],"density":[36,58,70],"(LDP)":[38],"problem.":[39,102],"Given":[40],"graph":[42],"weight":[46,82],"each":[48],"edge,":[49],"LDP":[51],"problem":[52,106],"aims":[53],"to":[54,83,116,122],"find":[55],"between":[60],"two":[61,135],"nodes":[62],"under":[63],"specified":[65],"constraint,":[67],"where":[68],"is":[74,107],"defined":[75],"ratio":[78],"length.":[86],"To":[87],"best":[89],"our":[91],"knowledge,":[92],"there":[93],"are":[94],"no":[95],"works":[97],"that":[98],"focus":[99],"We":[103],"prove":[104],"NP-hard.":[108],"Then":[109],"propose":[111,134],"an":[112],"A*-based":[113,129],"exact":[114,130],"algorithm":[115,143],"acquire":[117],"optimal":[119],"solution.":[120],"Due":[121],"expensive":[124],"computational":[125],"overhead":[126],"algorithm,":[131],"further":[133],"effective":[136],"approximation":[137],"algorithms,":[138],"label":[141],"setting":[142],"top-k":[146],"based":[147],"network":[148],"expansion":[149],"(k-NE)":[150],"algorithm.":[151],"Extensive":[152],"experiments":[153],"four":[155],"real":[156],"synthetic":[158],"datasets":[159],"verify":[160],"efficiency":[162],"effectiveness":[164],"proposed":[167],"algorithms.":[168]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}