Document Open Access Logo

Parameterized Streaming Algorithms for Topological Sorting

Authors Ho-Lin Chen , Peng-Ting Lin , Meng-Tsung Tsai

PDF HTML 5

Files

Thumbnail PDF
PDF
LIPIcs.WADS.2025.18.pdf
  • Filesize: 0.82 MB
  • 20 pages
HTML5 Logo HTML (experimental)
LIPIcs.WADS.2025.18.html

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Streaming, sublinear and near linear time algorithms
Keywords
  • Independence Number
  • Chain Cover
  • SCC Decomposition
  • 2-Satisfiability

Metrics

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

Abstract

Computing a topological ordering for an n-node directed acyclic graph (DAG) G is computationally challenging in streaming models. Chakrabarti et al. {[}SODA 2020{]} showed that in the insertion-only streaming model, every single-pass algorithm requires Ω(n²) space, and every k-pass algorithm requires n^{1+Ω(1/k)} space for any constant k ≥ 1. 
We study the parameterized complexity of streaming algorithms for topological sorting, considering two parameters: the independence number α and the maximum displacement δ. Our results include an O(1/ε)-pass O(α n^{1+ε})-space streaming algorithm and an O(n^{1/2})-pass O(n+δ²)-space streaming algorithm. For dense random DAGs, both α and δ are small, allowing us to improve the state-of-the-art for topological sorting in random DAGs.
As applications, we show that strongly connected components (SCC) decomposition and 2-satisfiability (2-SAT) can be solved in O(1/ε) passes using O(α n^{1+ε}) space and O(α_I n^{1+ε}) space, respectively, where α_I denotes the independence number of the implication graph induced by the input 2-SAT instance.

Cite As Get BibTex

Ho-Lin Chen, Peng-Ting Lin, and Meng-Tsung Tsai. Parameterized Streaming Algorithms for Topological Sorting. In 19th International Symposium on Algorithms and Data Structures (WADS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 349, pp. 18:1-18:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.WADS.2025.18

Author Details

Ho-Lin Chen
  • National Taiwan University, Taipei, Taiwan
Peng-Ting Lin
  • Academia Sinica, Taipei, Taiwan
Meng-Tsung Tsai
  • Academia Sinica, Taipei, Taiwan

Funding

This research was supported in part by the National Science and Technology Council under contract NSTC 114-2221-E-001-023 and 113-2221-E-002-204-MY3.

Acknowledgements

We want to thank the anonymous reviewers for their valuable comments.

References

  1. Akanksha Agrawal, Arindam Biswas, Édouard Bonnet, Nick Brettell, Radu Curticapean, Dániel Marx, Tillmann Miltzow, Venkatesh Raman, and Saket Saurabh. Parameterized streaming algorithms for Min-Ones d-SAT. In 39th Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), volume 150 of LIPIcs, pages 8:1-8:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. URL: https://doi.org/10.4230/LIPICS.FSTTCS.2019.8.
  2. Bengt Aspvall, Michael F. Plass, and Robert Endre Tarjan. A linear-time algorithm for testing the truth of certain quantified boolean formulas. Inf. Process. Lett., 8(3):121-123, 1979. URL: https://doi.org/10.1016/0020-0190(79)90002-4.
  3. Béla Bollobás and Graham R. Brightwell. The dimension of random graph orders. In The Mathematics of Paul Erdős II, pages 47-68. Springer, 2013. URL: https://doi.org/10.1007/978-1-4614-7254-4_5.
  4. Manuel Cáceres. Minimum chain cover in almost linear time. In 50th International Colloquium on Automata, Languages, and Programming (ICALP), volume 261 of LIPIcs, pages 31:1-31:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. URL: https://doi.org/10.4230/LIPICS.ICALP.2023.31.
  5. Amit Chakrabarti, Prantar Ghosh, Andrew McGregor, and Sofya Vorotnikova. Vertex ordering problems in directed graph streams. In Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1786-1802. SIAM, 2020. URL: https://doi.org/10.1137/1.9781611975994.109.
  6. Rajesh Chitnis and Graham Cormode. Towards a theory of parameterized streaming algorithms. In 14th International Symposium on Parameterized and Exact Computation (IPEC), volume 148 of LIPIcs, pages 7:1-7:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. URL: https://doi.org/10.4230/LIPICS.IPEC.2019.7.
  7. Rajesh Hemant Chitnis, Graham Cormode, Mohammad Taghi Hajiaghayi, and Morteza Monemizadeh. Parameterized streaming: Maximal matching and vertex cover. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1234-1251. SIAM, 2015. URL: https://doi.org/10.1137/1.9781611973730.82.
  8. Reinhard Diestel. Graph Theory, 4th Edition, volume 173 of Graduate texts in mathematics. Springer, 2012. Google Scholar
  9. R. P. Dilworth. A decomposition theorem for partially ordered sets. Annals of Mathematics, 51(1):161-166, 1950. Google Scholar
  10. Stefan Fafianie and Stefan Kratsch. Streaming kernelization. In Mathematical Foundations of Computer Science 2014 - 39th International Symposium (MFCS), volume 8635 of Lecture Notes in Computer Science, pages 275-286. Springer, 2014. URL: https://doi.org/10.1007/978-3-662-44465-8_24.
  11. Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, and Jian Zhang. On graph problems in a semi-streaming model. Theor. Comput. Sci., 348(2-3):207-216, 2005. URL: https://doi.org/10.1016/J.TCS.2005.09.013.
  12. Alan M. Frieze. On the independence number of random graphs. Discret. Math., 81(2):171-175, 1990. URL: https://doi.org/10.1016/0012-365X(90)90149-C.
  13. Neil D. Jones. Space-bounded reducibility among combinatorial problems. J. Comput. Syst. Sci., 11(1):68-85, 1975. URL: https://doi.org/10.1016/S0022-0000(75)80050-X.
  14. Neil D. Jones, Y. Edmund Lien, and William T. Laaser. New problems complete for nondeterministic log space. Math. Syst. Theory, 10:1-17, 1976. URL: https://doi.org/10.1007/BF01683259.
  15. Hossein Jowhari, Mert Saglam, and Gábor Tardos. Tight bounds for Lp samplers, finding duplicates in streams, and related problems. In Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, (PODS), pages 49-58. ACM, 2011. URL: https://doi.org/10.1145/1989284.1989289.
  16. Shimon Kogan and Merav Parter. Faster and unified algorithms for diameter reducing shortcuts and minimum chain covers. In Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 212-239. SIAM, 2023. URL: https://doi.org/10.1137/1.9781611977554.CH9.
  17. Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, and Meirav Zehavi. Meta-theorems for parameterized streaming algorithms. In Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 712-739. SIAM, 2024. Google Scholar
  18. Andrew McGregor. Graph stream algorithms: a survey. SIGMOD Rec., 43(1):9-20, 2014. URL: https://doi.org/10.1145/2627692.2627694.
  19. Yaron Minsky, Ari Trachtenberg, and Richard Zippel. Set reconciliation with nearly optimal communication complexity. IEEE Trans. Inf. Theory, 49(9):2213-2218, 2003. URL: https://doi.org/10.1109/TIT.2003.815784.
  20. S. Muthukrishnan. Data streams: Algorithms and applications. Found. Trends Theor. Comput. Sci., 1(2):117-236, August 2005. URL: https://doi.org/10.1561/0400000002.
  21. Jelle J. Oostveen and Erik Jan van Leeuwen. Parameterized complexity of streaming diameter and connectivity problems. Algorithmica, 86(9):2885-2928, 2024. URL: https://doi.org/10.1007/S00453-024-01246-Z.
  22. Warren Schudy. Finding strongly connected components in parallel using o(log² n) reachability queries. In Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 146-151. ACM, 2008. URL: https://doi.org/10.1145/1378533.1378560.
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