Document Open Access Logo

Cut Paths and Their Remainder Structure, with Applications

Authors Massimo Cairo, Shahbaz Khan , Romeo Rizzi , Sebastian Schmidt , Alexandru I. Tomescu , Elia C. Zirondelli

Thumbnail PDF


  • Filesize: 0.94 MB
  • 17 pages

Document Identifiers

Author Details

Massimo Cairo
  • Department of Computer Science, University of Helsinki, Finland
Shahbaz Khan
  • Department of Computer Science and Engineering, Indian Institute of Technology Roorkee, India
Romeo Rizzi
  • Department of Computer Science, University of Verona, Italy
Sebastian Schmidt
  • Department of Computer Science, University of Helsinki, Finland
Alexandru I. Tomescu
  • Department of Computer Science, University of Helsinki, Finland
Elia C. Zirondelli
  • Department of Mathematics, University of Trento, Italy

Cite AsGet BibTex

Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian Schmidt, Alexandru I. Tomescu, and Elia C. Zirondelli. Cut Paths and Their Remainder Structure, with Applications. In 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 254, pp. 17:1-17:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)


In a strongly connected graph G = (V,E), a cut arc (also called strong bridge) is an arc e ∈ E whose removal makes the graph no longer strongly connected. Equivalently, there exist u,v ∈ V, such that all u-v walks contain e. Cut arcs are a fundamental graph-theoretic notion, with countless applications, especially in reachability problems. In this paper we initiate the study of cut paths, as a generalisation of cut arcs, which we naturally define as those paths P for which there exist u,v ∈ V, such that all u-v walks contain P as subwalk. We first prove various properties of cut paths and define their remainder structures, which we use to present a simple O(m)-time verification algorithm for a cut path (|V| = n, |E| = m). Secondly, we apply cut paths and their remainder structures to improve several reachability problems from bioinformatics, as follows. A walk is called safe if it is a subwalk of every node-covering closed walk of a strongly connected graph. Multi-safety is defined analogously, by considering node-covering sets of closed walks instead. We show that cut paths provide simple O(m)-time algorithms verifying if a walk is safe or multi-safe. For multi-safety, we present the first linear time algorithm, while for safety, we present a simple algorithm where the state-of-the-art employed complex data structures. Finally we show that the simultaneous computation of remainder structures of all subwalks of a cut path can be performed in linear time, since they are related in a structured way. These properties yield an O(mn)-time algorithm outputting all maximal multi-safe walks, improving over the state-of-the-art algorithm running in time O(m²+n³). The results of this paper only scratch the surface in the study of cut paths, and we believe a rich structure of a graph can be revealed, considering the perspective of a path, instead of just an arc.

Subject Classification

ACM Subject Classification
  • Applied computing → Computational biology
  • Mathematics of computing → Paths and connectivity problems
  • Theory of computation → Graph algorithms analysis
  • reachability
  • cut arc
  • strong bridge
  • covering walk
  • safety
  • persistence
  • essentiality
  • genome assembly


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


  1. Nidia Obscura Acosta, Veli Mäkinen, and Alexandru I. Tomescu. A safe and complete algorithm for metagenomic assembly. Algorithms for Molecular Biology, 13(1):3:1-3:12, 2018. URL:
  2. Nidia Obscura Acosta and Alexandru I. Tomescu. Simplicity in eulerian circuits: Uniqueness and safety. arXiv, abs/2208.08522, 2022. URL:
  3. Benjamin Merlin Bumpus, Bart M. P. Jansen, and Jari J. H. de Kroon. Search-Space Reduction via Essential Vertices. In Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, and Grzegorz Herman, editors, 30th Annual European Symposium on Algorithms (ESA 2022), volume 244 of Leibniz International Proceedings in Informatics (LIPIcs), pages 30:1-30:15, Dagstuhl, Germany, 2022. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL:
  4. Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian Schmidt, and Alexandru I. Tomescu. Safety in s-t Paths, Trails and Walks. Algorithmica, 84:719-741, 2022. URL:
  5. Massimo Cairo, Paul Medvedev, Nidia Obscura Acosta, Romeo Rizzi, and Alexandru I. Tomescu. An Optimal O(nm) Algorithm for Enumerating All Walks Common to All Closed Edge-covering Walks of a Graph. ACM Trans. Algorithms, 15(4):48:1-48:17, 2019. URL:
  6. Massimo Cairo, Romeo Rizzi, Alexandru I. Tomescu, and Elia C. Zirondelli. Genome assembly, from practice to theory: Safe, complete and linear-time. In Nikhil Bansal, Emanuela Merelli, and James Worrell, editors, 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference), volume 198 of LIPIcs, pages 43:1-43:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. Google Scholar
  7. Marie Costa. Persistency in maximum cardinality bipartite matchings. Oper. Res. Lett., 15(3):143-9, 1994. URL:
  8. Wojciech Fraczak, Loukas Georgiadis, Andrew Miller, and Robert E Tarjan. Finding dominators via disjoint set union. Journal of Discrete Algorithms, 23:2-20, 2013. Google Scholar
  9. Loukas Georgiadis, Giuseppe F Italiano, Luigi Laura, and Nikos Parotsidis. 2-edge connectivity in directed graphs. ACM Transactions on Algorithms (TALG), 13(1):1-24, 2016. Google Scholar
  10. Loukas Georgiadis, Giuseppe F Italiano, Luigi Laura, and Nikos Parotsidis. 2-vertex connectivity in directed graphs. Information and Computation, 261:248-264, 2018. Google Scholar
  11. Loukas Georgiadis, Giuseppe F Italiano, and Nikos Parotsidis. Strong connectivity in directed graphs under failures, with applications. SIAM Journal on Computing, 49(5):865-926, 2020. Google Scholar
  12. Dan Gusfield. Algorithms on stings, trees, and sequences: Computer science and computational biology. Acm Sigact News, 28(4):41-60, 1997. Google Scholar
  13. P. L. Hammer, P. Hansen, and B. Simeone. Vertices belonging to all or to no maximum stable sets of a graph. SIAM Journal on Algebraic Discrete Methods, 3(4):511-522, 1982. URL:
  14. Giuseppe F Italiano, Luigi Laura, and Federico Santaroni. Finding strong bridges and strong articulation points in linear time. Theoretical Computer Science, 447:74-84, 2012. Google Scholar
  15. Giuseppe F Italiano, Nikos Parotsidis, and Eugenia Perekhodko. What’s inside a bow-tie: Analyzing the core of the web and of social networks. In Proceedings of the 2017 International Conference on Information System and Data Mining, pages 39-43, 2017. Google Scholar
  16. Niranjan Nagarajan and Mihai Pop. Parametric complexity of sequence assembly: theory and applications to next generation sequencing. Journal of computational biology, 16(7):897-908, 2009. Google Scholar
  17. Amatur Rahman and Paul Medvedev. Assembler artifacts include misassembly because of unsafe unitigs and underassembly because of bidirected graphs. Genome Research, 2022. URL:
  18. Robert Tarjan. Depth-first search and linear graph algorithms. SIAM journal on computing, 1(2):146-160, 1972. Google Scholar
  19. Robert Endre Tarjan. Edge-disjoint spanning trees and depth-first search. Acta Informatica, 6(2):171-185, 1976. Google Scholar
  20. Alexandru I. Tomescu and Paul Medvedev. Safe and complete contig assembly through omnitigs. Journal of Computational Biology, 24(6):590-602, 2017. Preliminary version appeared in RECOMB 2016. Google Scholar
  21. Esko Ukkonen. On-line construction of suffix trees. Algorithmica, 14(3):249-260, 1995. Google Scholar
  22. Pencho Yordanov and Jörg Stelling. Efficient manipulation and generation of kirchhoff polynomials for the analysis of non-equilibrium biochemical reaction networks. Journal of the Royal Society Interface, 17(165):20190828, 2020. Google Scholar
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail