A Hierarchical Contraction Scheme for Querying Big Graphs

Authors

• 1. Wenfei Fan (Beihang University; Shenzhen University; University of Edinburgh)
• 2. Yuanhao Li (University of Edinburgh)
• 3. Muyang Liu (University of Edinburgh)
• 4. Can Lu (Shenzhen University)

@inproceedings{fan_sigmod22,
        title = {{A Hierarchical Contraction Scheme for Querying Big Graphs}},
        author = {Fan, Wenfei and Li, Yuanhao and Liu, Muyang and Lu, Can},
        series = {{SIGMOD} '22},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3514221.3517862},
        url = {https://dl.acm.org/doi/10.1145/3514221.3517862},
        year = {2022}
}

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Outgoing Citations (Sorted by Pagerank)

Showing 23 of 23 cited papers.

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

Semantically Similar Papers