scientific article; zbMATH DE number 1063797
From MaRDI portal
Publication:4355484
Recommendations
- A linear time algorithm for computing the most reliable source on a series--parallel graph with unreliable edges
- A Linear Time Algorithm for Computing the Most Reliable Source on a Tree with Faulty Vertices
- A linear time algorithm for computing a most reliable source on a tree network with faulty nodes
- A divide-and-conquer algorithm for finding a most reliable source on a ring-embedded tree network with unreliable edges
Cited in
(14)- Network reliability: Heading out on the highway
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees
- A linear time algorithm for computing a most reliable source on a tree network with faulty nodes
- A divide-and-conquer algorithm for finding a most reliable source on a ring-embedded tree network with unreliable edges
- On the 2-MRS problem in a tree with unreliable edges
- A Linear Time Algorithm for Computing the Most Reliable Source on a Tree with Faulty Vertices
- Multiple facility location on a network with linear reliability order of edges
- The approximability of multiple facility location on directed networks with random arc failures
- Network location of a reliable center using the most reliable route policy
- A linear time algorithm for computing the most reliable source on a series--parallel graph with unreliable edges
- scientific article; zbMATH DE number 6863758 (Why is no real title available?)
- An edge-turbulence algorithm for the 2-MRS problem on trees with unreliable edges
- On the location of a constrained \(k\)-tree facility in a tree network with unreliable edges
- A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4355484)
