On the point-to-point connection problem
From MaRDI portal
Publication:673909
DOI10.1016/0020-0190(94)00216-LzbMATH Open0875.68444OpenAlexW2077731214MaRDI QIDQ673909FDOQ673909
Authors: Madan Natu, Shu-Cherng Fang
Publication date: 28 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(94)00216-l
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
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Parallel algorithms in computer science (68W10)
Cites Work
Cited In (11)
- Cost of sequential connection for points in space
- An \(s\)-\(t\) connection problem with adaptability
- Optimal connection problem of single source multiple sinks on directed networks
- The point-to-point delivery and connection problems: Complexity and algorithms
- Connection problems in mountains and monotonic allocation schemes.
- Parameterized Complexity of Directed Steiner Network with Respect to Shared Vertices and Arcs
- The point-to-point connection problem - analysis and algorithms
- Augmenting weighted graphs to establish directed point-to-point connectivity
- Efficient points on a network
- The One-Terminal TELPAK Problem
- The \(k\)-path tree matroid and its applications to survivable network design
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)