Document Open Access Logo

Near-Optimal Vertex Fault-Tolerant Labels for Steiner Connectivity

Authors Koustav Bhanja , Asaf Petruschka

PDF HTML 5

Files

Thumbnail PDF
PDF
LIPIcs.ESA.2025.44.pdf
  • Filesize: 0.84 MB
  • 13 pages
HTML5 Logo HTML (experimental)
LIPIcs.ESA.2025.44.html

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Graph algorithms analysis
  • Theory of computation → Data structures design and analysis
  • Theory of computation → Distributed algorithms
Keywords
  • Fault Tolerance
  • Labeling Schemes
  • Steiner Connectivity

Metrics

Abstract

We present a compact labeling scheme for determining whether a designated set of terminals in a graph remains connected after any f (or less) vertex failures occur. An f-FT Steiner connectivity labeling scheme for an n-vertex graph G = (V,E) with terminal set U ⊆ V provides labels to the vertices of G, such that given only the labels of any subset F ⊆ V with |F| ≤ f, one can determine if U remains connected in G-F. The main complexity measure is the maximum label length.
The special case U = V of global connectivity has been recently studied by Jiang, Parter, and Petruschka [Yonggang Jiang et al., 2025], who provided labels of n^{1-1/f} ⋅ poly(f,log n) bits. This is near-optimal (up to poly(f,log n) factors) by a lower bound of Long, Pettie and Saranurak [Yaowei Long et al., 2025]. Our scheme achieves labels of |U|^{1-1/f} ⋅ poly(f, log n) for general U ⊆ V, which is near-optimal for any given size |U| of the terminal set. To handle terminal sets, our approach differs from [Yonggang Jiang et al., 2025]. We use a well-structured Steiner tree for U produced by a decomposition theorem of Duan and Pettie [Ran Duan and Seth Pettie, 2020], and bypass the need for Nagamochi-Ibaraki sparsification [Hiroshi Nagamochi and Toshihide Ibaraki, 1992].

Cite As Get BibTex

Koustav Bhanja and Asaf Petruschka. Near-Optimal Vertex Fault-Tolerant Labels for Steiner Connectivity. In 33rd Annual European Symposium on Algorithms (ESA 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 351, pp. 44:1-44:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ESA.2025.44

Author Details

Koustav Bhanja
  • Weizmann Institute of Science, Rehovot, Israel
Asaf Petruschka
  • Weizmann Institute of Science, Rehovot, Israel

Funding

  • Bhanja, Koustav: Supported by Merav Parter’s European Research Council (ERC) grant under the European Union’s Horizon 2020 research and innovation programme, grant agreement No. 949083.
  • Petruschka, Asaf: Supported by an Azrieli Foundation fellowship, and by Merav Parter’s European Research Council (ERC) grant under the European Union’s Horizon 2020 research and innovation programme, grant agreement No. 949083.

Acknowledgements

We are thankful to Merav Parter for encouraging this collaboration and for valuable discussions.

References

  1. Serge Abiteboul, Stephen Alstrup, Haim Kaplan, Tova Milo, and Theis Rauhe. Compact labeling scheme for ancestor queries. SIAM J. Comput., 35(6):1295-1309, 2006. URL: https://doi.org/10.1137/S0097539703437211.
  2. Ittai Abraham, Shiri Chechik, and Cyril Gavoille. Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels. In Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, New York, NY, USA, May 19 - 22, 2012, pages 1199-1218. ACM, 2012. URL: https://doi.org/10.1145/2213977.2214084.
  3. Ittai Abraham, Shiri Chechik, Cyril Gavoille, and David Peleg. Forbidden-set distance labels for graphs of bounded doubling dimension. ACM Trans. Algorithms, 12(2):22:1-22:17, 2016. URL: https://doi.org/10.1145/2818694.
  4. Stephen Alstrup, Søren Dahlgaard, and Mathias Bæk Tejs Knudsen. Optimal induced universal graphs and adjacency labeling for trees. J. ACM, 64(4):27:1-27:22, 2017. URL: https://doi.org/10.1145/3088513.
  5. Stephen Alstrup, Cyril Gavoille, Esben Bistrup Halvorsen, and Holger Petersen. Simpler, faster and shorter labels for distances in graphs. In Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, pages 338-350. SIAM, 2016. URL: https://doi.org/10.1137/1.9781611974331.CH25.
  6. Stephen Alstrup, Esben Bistrup Halvorsen, and Kasper Green Larsen. Near-optimal labeling schemes for nearest common ancestors. In Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014, pages 972-982. SIAM, 2014. URL: https://doi.org/10.1137/1.9781611973402.72.
  7. Stephen Alstrup, Haim Kaplan, Mikkel Thorup, and Uri Zwick. Adjacency labeling schemes and induced-universal graphs. SIAM J. Discret. Math., 33(1):116-137, 2019. URL: https://doi.org/10.1137/16M1105967.
  8. Aviv Bar-Natan, Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, and Oren Weimann. Fault-tolerant distance labeling for planar graphs. Theor. Comput. Sci., 918:48-59, 2022. URL: https://doi.org/10.1016/J.TCS.2022.03.020.
  9. Surender Baswana and Abhyuday Pandey. The connectivity carcass of a vertex subset in a graph: both odd and even case. In 2025 Symposium on Simplicity in Algorithms, SOSA 2025, New Orleans, LA, USA, January 13-15, 2025, pages 385-422. SIAM, 2025. URL: https://doi.org/10.1137/1.9781611978315.30.
  10. Koustav Bhanja. Optimal sensitivity oracle for steiner mincut. In 35th International Symposium on Algorithms and Computation, ISAAC 2024, December 8-11, 2024, Sydney, Australia, volume 322 of LIPIcs, pages 10:1-10:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. URL: https://doi.org/10.4230/LIPICS.ISAAC.2024.10.
  11. Koustav Bhanja. Minimum+1 steiner cuts and dual edge sensitivity oracle: Bridging gap between global and (s,t)-cuts. In The 52nd EATCS International Colloquium on Automata, Languages, and Programming (ICALP), 2025. Google Scholar
  12. Marthe Bonamy, Cyril Gavoille, and Michal Pilipczuk. Shorter labeling schemes for planar graphs. SIAM J. Discret. Math., 36(3):2082-2099, 2022. URL: https://doi.org/10.1137/20M1330464.
  13. Itai Boneh, Shiri Chechik, Shay Golan, Shay Mozes, and Oren Weimann. Õptimal fault-tolerant labeling for reachability and approximate distances in directed planar graphs. Google Scholar
  14. Melvin A. Breuer. Coding the vertexes of a graph. IEEE Trans. Inf. Theory, 12(2):148-153, 1966. URL: https://doi.org/10.1109/TIT.1966.1053860.
  15. Melvin A Breuer and Jon Folkman. An unexpected result in coding the vertices of a graph. Journal of Mathematical Analysis and Applications, 20(3):583-600, 1967. URL: https://doi.org/10.1016/0022-247X(67)90082-0.
  16. Ruoxu Cen, William He, Jason Li, and Debmalya Panigrahi. Steiner connectivity augmentation and splitting-off in poly-logarithmic maximum flows. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2449-2488. SIAM, 2023. URL: https://doi.org/10.1137/1.9781611977554.CH95.
  17. Richard Cole and Ramesh Hariharan. A fast algorithm for computing steiner edge connectivity. In Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, pages 167-176, 2003. URL: https://doi.org/10.1145/780542.780568.
  18. Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté, and Andrew Twigg. Connectivity check in 3-connected planar graphs with obstacles. Electron. Notes Discret. Math., 31:151-155, 2008. URL: https://doi.org/10.1016/J.ENDM.2008.06.030.
  19. Bruno Courcelle and Andrew Twigg. Compact forbidden-set routing. In STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings, volume 4393 of Lecture Notes in Computer Science, pages 37-48. Springer, 2007. URL: https://doi.org/10.1007/978-3-540-70918-3_4.
  20. Matthew Ding and Jason Li. Deterministic minimum steiner cut in maximum flow time. In 32nd Annual European Symposium on Algorithms, ESA 2024, September 2-4, 2024, Royal Holloway, London, United Kingdom, volume 308 of LIPIcs, pages 46:1-46:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. URL: https://doi.org/10.4230/LIPICS.ESA.2024.46.
  21. Yefim Dinitz and Alek Vainshtein. The connectivity carcass of a vertex subset in a graph and its incremental maintenance. In Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, pages 716-725, 1994. URL: https://doi.org/10.1145/195058.195442.
  22. Yefim Dinitz and Alek Vainshtein. The general structure of edge-connectivity of a vertex subset in a graph and its incremental maintenance. odd case. SIAM J. Comput., 30(3):753-808, 2000. URL: https://doi.org/10.1137/S0097539797330045.
  23. Michal Dory and Merav Parter. Fault-tolerant labeling and compact routing schemes. In PODC '21: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, July 26-30, 2021, pages 445-455. ACM, 2021. URL: https://doi.org/10.1145/3465084.3467929.
  24. Ran Duan and Seth Pettie. Connectivity oracles for graphs subject to vertex failures. SIAM J. Comput., 49(6):1363-1396, 2020. URL: https://doi.org/10.1137/17M1146610.
  25. M. Furer and B. Raghavachari. Approximating the minimum-degree steiner tree to within one of optimal. Journal of Algorithms, 17(3):409-423, 1994. URL: https://doi.org/10.1006/jagm.1994.1042.
  26. Cyril Gavoille, David Peleg, Stéphane Pérennes, and Ran Raz. Distance labeling in graphs. J. Algorithms, 53(1):85-112, 2004. URL: https://doi.org/10.1016/J.JALGOR.2004.05.002.
  27. Pawel Gawrychowski and Przemyslaw Uznanski. Better distance labeling for unweighted planar graphs. Algorithmica, 85(6):1805-1823, 2023. URL: https://doi.org/10.1007/S00453-023-01133-Z.
  28. David Gibb, Bruce M. Kapron, Valerie King, and Nolan Thorn. Dynamic graph connectivity with improved worst case update time and sublinear space. CoRR, abs/1509.06464, 2015. URL: https://arxiv.org/abs/1509.06464.
  29. Zhongtian He, Shang-En Huang, and Thatchaphol Saranurak. Cactus representations in polylogarithmic max-flow via maximal isolating mincuts. In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1465-1502. SIAM, 2024. URL: https://doi.org/10.1137/1.9781611977912.60.
  30. Tai-Hsin Hsu and Hsueh-I Lu. An optimal labeling for node connectivity. In Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, volume 5878 of Lecture Notes in Computer Science, pages 303-310. Springer, 2009. URL: https://doi.org/10.1007/978-3-642-10631-6_32.
  31. Rani Izsak and Zeev Nutov. A note on labeling schemes for graph connectivity. Inf. Process. Lett., 112(1-2):39-43, 2012. URL: https://doi.org/10.1016/J.IPL.2011.10.001.
  32. Taisuke Izumi, Yuval Emek, Tadashi Wadayama, and Toshimitsu Masuzawa. Deterministic fault-tolerant connectivity labeling scheme. In Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, PODC 2023, Orlando, FL, USA, June 19-23, 2023, pages 190-199. ACM, 2023. URL: https://doi.org/10.1145/3583668.3594584.
  33. Yonggang Jiang, Merav Parter, and Asaf Petruschka. New oracles and labeling schemes for vertex cut queries. CoRR, abs/2501.13596, 2025. URL: https://doi.org/10.48550/arXiv.2501.13596.
  34. Sampath Kannan, Moni Naor, and Steven Rudich. Implicit representation of graphs. SIAM J. Discret. Math., 5(4):596-603, 1992. URL: https://doi.org/10.1137/0405049.
  35. Michal Katz, Nir A. Katz, Amos Korman, and David Peleg. Labeling schemes for flow and connectivity. SIAM J. Comput., 34(1):23-40, 2004. URL: https://doi.org/10.1137/S0097539703433912.
  36. Evangelos Kosinas. Connectivity Queries Under Vertex Failures: Not Optimal, but Practical. In 31st Annual European Symposium on Algorithms (ESA 2023), volume 274 of Leibniz International Proceedings in Informatics (LIPIcs), pages 75:1-75:13, Dagstuhl, Germany, 2023. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.ESA.2023.75.
  37. Yaowei Long, Seth Pettie, and Thatchaphol Saranurak. Connectivity labeling schemes for edge and vertex faults via expander hierarchies. In Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1-47, 2025. URL: https://doi.org/10.1137/1.9781611978322.1.
  38. Yaowei Long and Thatchaphol Saranurak. Near-optimal deterministic vertex-failure connectivity oracles. In 63rd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2022, Denver, CO, USA, October 31 - November 3, 2022, pages 1002-1010. IEEE, 2022. URL: https://doi.org/10.1109/FOCS54457.2022.00098.
  39. Yaowei Long and Yunfan Wang. Better decremental and fully dynamic sensitivity oracles for subgraph connectivity. In 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8-12, 2024, Tallinn, Estonia, volume 297 of LIPIcs, pages 109:1-109:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. URL: https://doi.org/10.4230/LIPICS.ICALP.2024.109.
  40. Hiroshi Nagamochi and Toshihide Ibaraki. A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph. Algorithmica, 7(5&6):583-596, 1992. URL: https://doi.org/10.1007/BF01758778.
  41. Merav Parter and Asaf Petruschka. Õptimal dual vertex failure connectivity labels. In Christian Scheideler, editor, 36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA, volume 246 of LIPIcs, pages 32:1-32:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. URL: https://doi.org/10.4230/LIPICS.DISC.2022.32.
  42. Merav Parter, Asaf Petruschka, and Seth Pettie. Connectivity labeling and routing with multiple vertex failures. In Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC 2024, Vancouver, BC, Canada, June 24-28, 2024, pages 823-834. ACM, 2024. URL: https://doi.org/10.1145/3618260.3649729.
  43. Mihai Pătraşcu and Mikkel Thorup. Planning for fast connectivity updates. In 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, Proceedings, pages 263-271. IEEE Computer Society, 2007. URL: https://doi.org/10.1109/FOCS.2007.59.
  44. Seth Pettie, Thatchaphol Saranurak, and Longhui Yin. Optimal vertex connectivity oracles. In STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022, pages 151-161. ACM, 2022. URL: https://doi.org/10.1145/3519935.3519945.
  45. Michal Pilipczuk, Nicole Schirrmacher, Sebastian Siebertz, Szymon Torunczyk, and Alexandre Vigny. Algorithms and data structures for first-order logic with connectivity under vertex failures. In 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4-8, 2022, Paris, France, volume 229 of LIPIcs, pages 102:1-102:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. URL: https://doi.org/10.4230/LIPICS.ICALP.2022.102.
  46. Mikkel Thorup and Uri Zwick. Approximate distance oracles. J. ACM, 52(1):1-24, 2005. URL: https://doi.org/10.1145/1044731.1044732.
  47. Jan van den Brand and Thatchaphol Saranurak. Sensitive distance and reachability oracles for large batch updates. In 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, November 9-12, 2019, pages 424-435. IEEE Computer Society, 2019. URL: https://doi.org/10.1109/FOCS.2019.00034.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact