2023
DOI: 10.5540/tcam.2022.024.01.00019
|View full text |Cite
|
Sign up to set email alerts
|

An Improved Vectorization Algorithm to Solve the d-MP Problem

Abstract: The d-minimal path (d-MP) problem is to find all the system state vectors (SSV) under which d units of data can be transmitted from a source node to a destination node in a stochastic-flow network (SFN). This problem has been very attractive in the last decades as one can compute the exact amount of the network’s reliability through the d-MPs. Although several algorithms have been proposed in the literature to address the problem, the research continues because it is NP-hard. Since the number of d-MPs grows ex… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
references
References 36 publications
0
0
0
Order By: Relevance