Document Open Access Logo

Testing Depth First Search Numbering

Authors Artur Czumaj , Christian Sohler , Stefan Walzer

PDF

File

Thumbnail PDF
PDF
LIPIcs.ESA.2025.78.pdf
  • Filesize: 2.37 MB
  • 16 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Streaming, sublinear and near linear time algorithms
Keywords
  • Randomized Algorithms
  • Graph Algorithms
  • Property Testing

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

Property Testing is a formal framework to study the computational power and complexity of sampling from combinatorial objects. A central goal in standard graph property testing is to understand which graph properties are testable with sublinear query complexity. Here, a graph property P is testable with a sublinear query complexity if there is an algorithm that makes a sublinear number of queries to the input graph and accepts with probability at least 2/3, if the graph has property P, and rejects with probability at least 2/3 if it is ε-far from every graph that has property P.
In this paper, we introduce a new variant of the bounded degree graph model. In this variant, in addition to the standard representation of a bounded degree graph, we assume that every vertex v has a unique label num(v) from {1, … , |V|}, and in addition to the standard queries in the bounded degree graph model, we also allow a property testing algorithm to query for the label of a vertex (but not for a vertex with a given label).
Our new model is motivated by certain graph processes such as a DFS traversal, which assign consecutive numbers (labels) to the vertices of the graph. We want to study which of these numberings can be tested in sublinear time. As a first step in understanding such a model, we develop a property testing algorithm for discovery times of a DFS traversal with query complexity O(n^{1/3}/ε) and for constant ε > 0 we give a matching lower bound.

Cite As Get BibTex

Artur Czumaj, Christian Sohler, and Stefan Walzer. Testing Depth First Search Numbering. In 33rd Annual European Symposium on Algorithms (ESA 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 351, pp. 78:1-78:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ESA.2025.78

Author Details

Artur Czumaj
  • Department of Computer Science and DIMAP, University of Warwick, Coventry, UK
  • University of Cologne, Germany
Christian Sohler
  • University of Cologne, Germany
Stefan Walzer
  • Karlsruhe Institute of Technology, Germany

Funding

  • Czumaj, Artur: Research partially supported by the Centre for Discrete Mathematics and its Applications (DIMAP), by a Weizmann-UK Making Connections Grant, and by an IBM Award.
  • Walzer, Stefan: Research funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) - 465963632.

References

  1. Isolde Adler, Noleen Köhler, and Pan Peng. On testability of first-order properties in bounded-degree graphs and connections to proximity-oblivious testing. SIAM Journal on Computing, 53(4):825-883, 2024. URL: https://doi.org/10.1137/23M1556253.
  2. Noga Alon, Eldar Fischer, Ilan Newman, and Asaf Shapira. A combinatorial characterization of the testable graph properties: It’s all about regularity. SIAM Journal on Computing, 39(1):143-167, 2009. URL: https://doi.org/10.1137/060667177.
  3. Itai Benjamini, Oded Schramm, and Asaf Shapira. Every minor-closed property of sparse graphs is testable. Advances in Mathematics, 223(6):2200-2218, 2010. Google Scholar
  4. Arnab Bhattacharyya and Yuichi Yoshida. Property Testing - Problems and Techniques. Springer Verlag, 2022. URL: https://doi.org/10.1007/978-981-16-8622-1.
  5. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, 4th Edition. MIT Press and McGraw-Hill, 2022. Google Scholar
  6. Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, and Christian Sohler. Finding cycles and trees in sublinear time. Random Structures & Algorithms, 45(2):139-184, 2014. URL: https://doi.org/10.1002/RSA.20462.
  7. Artur Czumaj, Asaf Shapira, and Christian Sohler. Testing hereditary properties of nonexpanding bounded-degree graphs. SIAM Journal on Computing, 38(6):2499-2510, 2009. URL: https://doi.org/10.1137/070681831.
  8. Hendrik Fichtenberger, Pan Peng, and Christian Sohler. Every testable (infinite) property of bounded-degree graphs contains an infinite hyperfinite subproperty. In Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 714-726, 2019. URL: https://doi.org/10.1137/1.9781611975482.45.
  9. Oded Goldreich. Introduction to Property Testing. Cambridge University Press, 2017. URL: https://doi.org/10.1017/9781108135252.
  10. Oded Goldreich, Shafi Goldwasser, and Dana Ron. Property testing and its connection to learning and approximation. Journal of the ACM, 45(4):653-750, 1998. URL: https://doi.org/10.1145/285055.285060.
  11. Oded Goldreich and Dana Ron. A sublinear bipartiteness tester for bunded degree graphs. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC), pages 289-298, 1998. URL: https://doi.org/10.1145/276698.276767.
  12. Oded Goldreich and Dana Ron. Property testing in bounded degree graphs. Algorithmica, 32(2):302-343, 2002. URL: https://doi.org/10.1007/S00453-001-0078-7.
  13. Oded Goldreich and Dana Ron. On proximity-oblivious testing. SIAM Journal on Computing, 40(2):534-566, 2011. URL: https://doi.org/10.1137/100789646.
  14. Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguyen, and Krzysztof Onak. Local graph partitions for approximation and testing. In Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 22-31, 2009. URL: https://doi.org/10.1109/FOCS.2009.77.
  15. John E. Hopcroft and Robert E. Tarjan. Efficient planarity testing. Journal of the ACM, 21(4):549-568, 1974. URL: https://doi.org/10.1145/321850.321852.
  16. Jon M. Kleinberg and Éva Tardos. Algorithm Design. Addison-Wesley, 2013. Google Scholar
  17. Édouard Lucas. Récreations Mathématiques. Librairie Albert Banchard, Paris, 1882. Google Scholar
  18. Ilan Newman and Christian Sohler. Every property of hyperfinite graphs is testable. SIAM Journal on Computing, 42(3):1095-1112, 2013. URL: https://doi.org/10.1137/120890946.
  19. Sofya Raskhodnikova, Dana Ron, Amir Shpilka, and Adam D. Smith. Strong lower bounds for approximating distribution support size and the distinct elements problem. SIAM Journal on Computing, 39(3):813-842, 2009. URL: https://doi.org/10.1137/070701649.
  20. Ronitt Rubinfeld and Madhu Sudan. Robust characterizations of polynomials with applications to program testing. SIAM Journal on Computing, 25(2):252-271, 1996. URL: https://doi.org/10.1137/S0097539793255151.
  21. Robert Endre Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1(2):146-160, 1972. URL: https://doi.org/10.1137/0201010.
  22. Robert Endre Tarjan. Edge-disjoint spanning trees and depth-first search. Acta Informatica, 6:171-185, 1976. URL: https://doi.org/10.1007/BF00268499.
  23. G. Tarry. Le problème des labyrinthes. Nouvelles Annales de Mathématiques, 3e série, 14:187-190, 1895. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

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