Shortest Paths Discovery in Uncertain Networks via Transfer Learning

Summary: Uncertain graphs with probabilistic edges: finding the most probable shortest path between node pairs. Presents a fast non-learning Phase 2 sampler and a transfer-learning based predictor that estimates path probabilities without costly simulations, achieving up to 5x–210x speedups and scalable cross-domain generalization. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: hc365267a289ed940
Venue: SIGMOD
Year: 2023
Pagerank: 5.2056825e-05
Overall Rank: 9,240 | 37.88%
DOI: 10.1145/3589286

Incoming Non-self Citations Over Time

Authors

1. Shixun Huang (Royal Melbourne Institute of Technology)
2. Zhifeng Bao (Royal Melbourne Institute of Technology)

BibTeX Citation

@inproceedings{huang_sigmod23,
        title = {{Shortest Paths Discovery in Uncertain Networks via Transfer Learning}},
        author = {Huang, Shixun and Bao, Zhifeng},
        series = {{SIGMOD} '23},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3589286},
        url = {https://dl.acm.org/doi/10.1145/3589286},
        year = {2023}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
10,572	GeoKGM: A Multimodal Large Language Model for Zero-Shot Knowledge Graph Completion in Geospatial Databases	2026	SIGMOD	4.9793485e-05

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
1,063	k-Nearest Neighbors in Uncertain Graphs	2010	VLDB	0.00012208695
1,260	Distance-Constraint Reachability Computation in Uncertain Graphs	2011	VLDB	0.00011296964
1,414	Effective Community Search over Large Spatial Graphs	2017	VLDB	0.0001073756
3,036	Injecting Uncertainty in Graphs for Identity Obfuscation	2012	VLDB	7.731521e-05
3,632	Efficient and Effective Algorithms for Clustering Uncertain Graphs	2019	VLDB	7.1494448e-05
3,820	The Pursuit of a Good Possible World: Extracting Representative Instances of Uncertain Graphs	2014	SIGMOD	7.005206e-05
5,754	An In-Depth Comparison of s-t Reliability Algorithms over Uncertain Graphs	2019	VLDB	6.0058421e-05
5,951	Shortest Paths and Centrality in Uncertain Networks	2021	VLDB	5.9366845e-05
6,506	Influence Maximization in Real-World Closed Social Networks	2023	VLDB	5.7608239e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	10,685	Scalable Privacy-Preserving Shortest Path Distance Computation via 2-Hop Labeling in MPC	2026	SIGMOD
2	1,260	Distance-Constraint Reachability Computation in Uncertain Graphs	2011	VLDB
3	11,309	Beyond Shortest Paths: Node Fairness in Route Recommendation	2025	VLDB
4	4,028	Shortest Paths and Distances with Differential Privacy	2016	PODS
5	9,914	Efficient Stochastic Routing in Path-Centric Uncertain Road Networks	2024	VLDB
6	6,988	An Experimental Evaluation and Guideline for Path Finding in Weighted Dynamic Network	2021	VLDB
7	6,161	On Uncertain Graphs Modeling and Queries	2015	VLDB
8	6,475	Clustering Uncertain Graphs	2018	VLDB
9	1,063	k-Nearest Neighbors in Uncertain Graphs	2010	VLDB
10	5,951	Shortest Paths and Centrality in Uncertain Networks	2021	VLDB