Hop-Constrained s-t Simple Path Enumeration in Large Uncertain Graphs

Li, Xia; Hao, Kongzhang; Yang, Zhengyi; Cao, Xin; Zhang, Wenjie

doi:10.1007/978-3-031-15512-3_9

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2022

2024

Publication Types

Select...

Other2

Book1

Article1

Relationship

Self Cite0

Independent4

Authors

Journals

Cited by 4 publications

(1 citation statement)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Many real-world networks [19], [20] naturally impose a quality constraint over edges. For instance, in a road network, road segments may specify the weight limits permitted for auto-trucks.…”

Section: Introductionmentioning

confidence: 99%

Efficiently Answering Quality Constrained Shortest Distance Queries in Large Graphs

Peng¹,

Ma²,

Zhang³

et al. 2022

Preprint

View full text Add to dashboard Cite

The shortest-path distance is a fundamental concept in graph analytics and has been extensively studied in the literature. In many real-world applications, quality constraints are naturally associated with edges in the graphs and finding the shortest distance between two vertices s and t along only valid edges (i.e., edges that satisfy a given quality constraint) is also critical. In this paper, we investigate this novel and important problem of quality constraint shortest distance queries. We propose an efficient index structure based on 2-hop labeling approaches. Supported by a path dominance relationship incorporating both quality and length information, we demonstrate the minimal property of the new index. An efficient query processing algorithm is also developed. Extensive experimental studies over real-life datasets demonstrates efficiency and effectiveness of our techniques.

show abstract

Section: Introductionmentioning

confidence: 99%