Reachability queries are a fundamental operation in large graph analysis, with applications in domains such as social networks, finance, program analysis, and XML query processing. Although many reachability indexes have been proposed, existing empirical studies remain limited in benchmark diversity, evaluation dimensi...
Huangleshuai He, Zheng-Yi Yang, Dong Wen et al.· World wide web (Bussum)· 0 citations
This work proposes Partitioned Tree-Cover Interval Labeling (PTIL), a restricted-domain reachability indexing framework that extends classical Tree-Cover Labeling, and develops two instantiations: PTIL-g , a grouped scheme for scalable domain-aligned indexing, and PTIL-p, which additionally leverages query distribution...
Huangleshuai He, Zheng-Yi Yang, Yi-Fu Tang et al.· International Conference on...· 1 citation
Travel-planning agents generate itineraries that may become infeasible after acceptance because of flight cancellations, hotel unavailability, or attraction closures. Revising these itineraries involves full replanning, classical plan repair, and LLM-based travel-agent revision, whose differing task formulations and ev...
Xiao-Fei Yuan, Yan Zhang, Shao-Bo Qiao et al.· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.