{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T10:11:54Z","timestamp":1780049514410,"version":"3.53.1"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Collaborative Innovation Center of Novel Software Technology and Industrialization"},{"DOI":"10.13039\/501100012246","name":"Priority Academic Program Development of Jiangsu Higher Education Institutions","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012246","id-type":"DOI","asserted-by":"publisher"}]},{"name":"University of North Carolina at Greensboro (UNCG) Start-Up Funds and Faculty First Award"},{"name":"Hong Kong Research Grants Council through Theme-Based Research Scheme","award":["T22-50\/23-R"],"award-info":[{"award-number":["T22-50\/23-R"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Intell. Transport. Syst."],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1109\/tits.2025.3544252","type":"journal-article","created":{"date-parts":[[2025,2,27]],"date-time":"2025-02-27T13:55:23Z","timestamp":1740664523000},"page":"8513-8524","source":"Crossref","is-referenced-by-count":1,"title":["Finding the Maximum Density Path Within Constrained Length in a Graph"],"prefix":"10.1109","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9476-0937","authenticated-orcid":false,"given":"Detian","family":"Zhang","sequence":"first","affiliation":[{"name":"Institute of Artificial Intelligence, Department of Computer Science and Technology, Soochow University, Suzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hongwei","family":"Tang","sequence":"additional","affiliation":[{"name":"Institute of Artificial Intelligence, Department of Computer Science and Technology, Soochow University, Suzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chunjiang","family":"Zhu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of North Carolina at Greensboro, Greensboro, NC, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3370-471X","authenticated-orcid":false,"given":"Qing","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Computing, The Hong Kong Polytechnic University, Hong Kong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2530531"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476267"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316320"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i14.17450"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/0216034"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3126254"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2773492"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-020-00604-x"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389735"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.08.031"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-005-6853-7"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-009-0328-z"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1002\/net.10090"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1111\/1475-3995.00003"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2006.06.002"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.09.027"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/1-4020-8099-9_24"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22685-4_3"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/BF02523689"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v5i1.18322"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v30i1.6647"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(98)00086-1"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2820783.2820846"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3308560.3317052"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/0-306-47536-7_13"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1080\/03155986.1988.11732063"},{"key":"ref27","article-title":"A two-phase resource constrained shortest path algorithm for acyclic graphs","author":"Jaumard","year":"1999"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3539597.3570434"}],"container-title":["IEEE Transactions on Intelligent Transportation Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6979\/11021249\/10907792.pdf?arnumber=10907792","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T20:51:50Z","timestamp":1770411110000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10907792\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6]]},"references-count":28,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tits.2025.3544252","relation":{},"ISSN":["1524-9050","1558-0016"],"issn-type":[{"value":"1524-9050","type":"print"},{"value":"1558-0016","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6]]}}}