On the point-to-point connection problem
From MaRDI portal
Publication:673909
Recommendations
- The point-to-point connection problem - analysis and algorithms
- The point-to-point delivery and connection problems: Complexity and algorithms
- Optimal connection problem of single source multiple sinks on directed networks
- Efficient points on a network
- An efficient time and space K point-to-point shortest simple paths algorithm
Cites work
Cited in
(11)- Efficient points on a network
- The \(k\)-path tree matroid and its applications to survivable network design
- The point-to-point connection problem - analysis and algorithms
- Optimal connection problem of single source multiple sinks on directed networks
- Cost of sequential connection for points in space
- Parameterized Complexity of Directed Steiner Network with Respect to Shared Vertices and Arcs
- Augmenting weighted graphs to establish directed point-to-point connectivity
- Connection problems in mountains and monotonic allocation schemes.
- An \(s\)-\(t\) connection problem with adaptability
- The point-to-point delivery and connection problems: Complexity and algorithms
- The One-Terminal TELPAK Problem
This page was built for publication: On the point-to-point connection problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673909)