Safety in \(s\)-\(t\) paths, trails and walks
From MaRDI portal
Publication:2118205
DOI10.1007/s00453-021-00877-wOpenAlexW3207959194MaRDI QIDQ2118205
Romeo Rizzi, Alexandru I. Tomescu, Shahbaz Khan, Massimo Cairo, Sebastian M. Schmidt
Publication date: 22 March 2022
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-021-00877-w
graph algorithmsafetydirected graphgenome assemblyconnectivity problemstrong articulation pointstrong bridge
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimum \(d\)-blockers and \(d\)-transversals in graphs
- Finding strong bridges and strong articulation points in linear time
- Blockers and transversals
- A linear-time algorithm for a special case of disjoint set union
- The directed subgraph homeomorphism problem
- Edge-disjoint spanning trees and depth-first search
- Persistency in the assignment and transportation problems
- Persistency in maximum cardinality bipartite matchings
- A note on finding the bridges of a graph
- A simplified algorithm computing all \(s-t\) bridges and articulation points
- Safe and Complete Contig Assembly Via Omnitigs
- Handbook of Graph Theory
- Maximal Flow Through a Network
- Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems
- Vertices Belonging to All or to No Maximum Stable Sets of a Graph
- Dominators in Linear Time
- A more fine‐grained complexity analysis of finding the most vital edges for undirected shortest paths
- An Optimal O ( nm ) Algorithm for Enumerating All Walks Common to All Closed Edge-covering Walks of a Graph
This page was built for publication: Safety in \(s\)-\(t\) paths, trails and walks
