Efficient algorithms for listing \(k\) disjoint \(st\)-paths in graphs

DOI10.1007/978-3-319-77404-6_40zbMath1485.68184OpenAlexW2789714963MaRDI QIDQ2294713

Andrea Marino, Luca Versari, Roberto Grossi

Publication date: 12 February 2020

Full work available at URL: https://doi.org/10.1007/978-3-319-77404-6_40

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Disjoint multipath closeness centrality ⋮ On b-acyclic chromatic number of a graph

This page was built for publication: Efficient algorithms for listing \(k\) disjoint \(st\)-paths in graphs