Reachability Queries on Dynamic Temporal Bipartite Graphs
Authors: 
Lohan Meunier, Ying ZhaoAuthors Info & Claims
Lohan Meunier, Ying ZhaoAuthors Info & ClaimsArticle No.: 97, Pages 1 - 11
Abstract
Temporal graphs are widely used to model movement phenomena in various real-world applications, such as disease spreading, information propagation, and logistics. In particular, the spread of diseases on a people-location network can be effectively represented using temporal bipartite graphs with edges available at specified time intervals. The main objective of this research is to address the problem of querying reachability on dynamic temporal bipartite graphs, where the graph is subject to changes such as vertex/edge deletion or addition. Graph modifications can reflect phenomena such as location closures or shifting population. To tackle this problem, we propose an effective index called the WTB-index (Wedge-based Temporal Bipartite Index), designed specifically for querying reachability on dynamic temporal bipartite graphs. Unlike existing approaches, the WTB-index enables efficient query processing without the need for index reconstruction when the graph undergoes changes. Experiments on a variety of datasets as well as a case study on a real-world people-location network are conducted using the WTB-index to demonstrate its effectiveness.
References
[1]
Christopher L Barrett, Keith R Bisset, Stephen G Eubank, Xizhou Feng, and Madhav V Marathe. 2008. Episimdemics: an efficient algorithm for simulating the spread of infectious disease over large realistic social networks. In SC'08: Proceedings of the 2008 ACM/IEEE Conference on Supercomputing. IEEE, 1--12.
[2]
Xiaoshuang Chen, Kai Wang, Xuemin Lin, Wenjie Zhang, Lu Qin, and Ying Zhang. 2021. Efficiently answering reachability and path queries on temporal bipartite graphs. Proceedings of the VLDB Endowment (2021).
[3]
Edith Cohen, Eran Halperin, Haim Kaplan, and Uri Zwick. 2003. Reachability and distance queries via 2-hop labels. SIAM J. Compiti 32, 5 (2003), 1338--1355.
[4]
Jessica Enright, Kitty Meeks, George B Mertzios, and Viktor Zamaraev. 2021. Deleting edges to restrict the size of an epidemic in temporal networks. J. Comput. System Sci. 119 (2021), 60--77.
[5]
Jessica Enright, Kitty Meeks, and Fiona Skerman. 2021. Assigning times to minimise reachability in temporal graphs. J. Comput. System Sci. 115 (2021), 169--186.
[6]
Stephen Eubank. 2005. Network based models of infectious disease spread. Japanese journal of infectious diseases 58, 6 (2005), S.
[7]
Stephen Eubank, Hasan Guclu, VS Anil Kumar, Madhav V Marathe, Aravind Srinivasan, Zoltan Toroczkai, and Nan Wang. 2004. Modelling disease outbreaks in realistic urban social networks. Nature 429, 6988 (2004), 180--184.
[8]
Ruoming Jin, Yang Xiang, Ning Ruan, and David Fuhry. 2009. 3-hop: a high-compression indexing scheme for reachability query. In Proceedings of the 2009 ACM SIGMOD International Conference on Management of data. 813--826.
[9]
David Kempe, Jon Kleinberg, and Amit Kumar. 2000. Connectivity and inference problems for temporal networks. In Proceedings of the thirty-second annual ACM symposium on Theory of computing. 504--513.
[10]
Kitty Meeks. 2022. Reducing Reachability in Temporal Graphs: Towards a More Realistic Model of Real-World Spreading Processes. In Revolutions and Revelations in Computability: 18th Conference on Computability in Europe, CiE 2022, Swansea, UK, July 11--15, 2022, Proceedings. Springer, 186--195.
[11]
Hendrik Molter, Malte Renken, and Philipp Zschoche. 2021. Temporal reachability minimization: Delaying vs. deleting. arXiv preprint arXiv:2102.10814 (2021).
[12]
Mark EJ Newman. 2002. Spread of epidemic disease on networks. Physical review E 66, 1 (2002), 016128.
[13]
Lutz Oettershagen. 2022. Temporal Graph Algorithms. Ph.D. Dissertation. Universitäts-und Landesbibliothek Bonn.
[14]
Costas Bouyioukos Pavlopoulou, Evripides Markou, and G Pantelis. 2020. Corrigendum to: Bipartite graphs in systems biology and medicine: a survey of methods and applications. order 2 (2020), S2.
[15]
You Peng, Ying Zhang, Xuemin Lin, Lu Qin, and Wenjie Zhang. 2020. Answering billion-scale label-constrained reachability queries within microsecond. Proceedings of the VLDB Endowment 13, 6 (2020), 812--825.
[16]
Silke Trißl and Ulf Leser. 2007. Fast and practical indexing and querying of very large graphs. In Proceedings of the 2007 ACM SIGMOD international conference on Management of data. 845--856.
[17]
Lucien DJ Valstar, George HL Fletcher, and Yuichi Yoshida. 2017. Landmark indexing for evaluation of label-constrained reachability queries. In Proceedings of the 2017 ACM International Conference on Management of Data. 345--358.
[18]
Haixun Wang, Hao He, Jun Yang, Philip S Yu, and Jeffrey Xu Yu. 2006. Dual labeling: Answering graph reachability queries in constant time. In 22nd International Conference on Data Engineering (ICDE'06). IEEE, 75--75.
[19]
Hao Wei, Jeffrey Xu Yu, Can Lu, and Ruoming Jin. 2018. Reachability querying: an independent permutation labeling approach. The VLDB Journal 27 (2018), 1--26.
[20]
Huanhuan Wu, James Cheng, Silu Huang, Yiping Ke, Yi Lu, and Yanyan Xu. 2014. Path problems in temporal graphs. Proceedings of the VLDB Endowment 7, 9 (2014), 721--732.
[21]
Huanhuan Wu, Yuzhen Huang, James Cheng, Jinfeng Li, and Yiping Ke. 2016. Reachability and time-based path queries in temporal graphs. In 2016 IEEE 32nd International Conference on Data Engineering (ICDE). IEEE, 145--156.
[22]
Hilmi Yildirim, Vineet Chaoji, and Mohammed J Zaki. 2010. Grail: Scalable reachability index for large graphs. Proceedings of the VLDB Endowment 3, 1--2 (2010), 276--284.
[23]
Jeffrey Xu Yu and Jiefeng Cheng. 2010. Graph reachability queries: A survey. Managing and Mining Graph Data (2010), 181--215.
[24]
Tianming Zhang, Yunjun Gao, Lu Chen, Wei Guo, Shiliang Pu, Baihua Zheng, and Christian S Jensen. 2019. Efficient distributed reachability querying of massive temporal graphs. The VLDB Journal 28 (2019), 871--896.
[25]
Andy Diwen Zhu, Wenqing Lin, Sibo Wang, and Xiaokui Xiao. 2014. Reachability queries on large dynamic graphs: a total order approach. In Proceedings of the 2014 ACM SIGMOD international conference on Management of data. 1323--1334.
Index Terms
- Reachability Queries on Dynamic Temporal Bipartite Graphs
Recommendations
A note on transformations of edge colorings of bipartite graphs
The author and A. Mirumian proved the following theorem: Let G be a bipartite graph with maximum degree @D and let t,n be integers, t>=n>=@D. Then it is possible to obtain, from one proper edge t-coloring of G, any proper edge n-coloring of G using only ...
Dominating induced matching in some subclasses of bipartite graphs
AbstractA subset M ⊆ E of edges of a graph G = ( V , E ) is called a matching if no two edges of M share a common vertex. An edge e ∈ E is said to dominate itself and all other edges adjacent to it. A matching M in a graph G = ( V , E ) is ...
Biclique Graphs of K3-free Graphs and Bipartite Graphs
AbstractA biclique of a graph is a maximal complete bipartite subgraph. The biclique graph of a graph G, KB(G), defined as the intersection graph of the bicliques of G, was introduced and characterized in 2010 by Groshaus and Szwarcfiter. However, this ...
Comments
Information & Contributors
Information
Published In
November 2023
686 pages
ISBN:9798400701689
DOI:10.1145/3589132
- General Chairs:
- Maria Luisa Damiani,
- Matthias Renz,
- Program Chairs:
- Ahmed Eldawy,
- Peer Kröger,
- Mario A Nascimento
Copyright © 2023 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 22 December 2023
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
SIGSPATIAL '23
Sponsor:
SIGSPATIAL '23: 31st ACM International Conference on Advances in Geographic Information Systems
November 13 - 16, 2023
Hamburg, Germany
Acceptance Rates
Overall Acceptance Rate 257 of 1,238 submissions, 21%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 223Total Downloads
- Downloads (Last 12 months)206
- Downloads (Last 6 weeks)42
Reflects downloads up to 28 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in