2014
DOI: 10.1109/tr.2014.2299673
|View full text |Cite
|
Sign up to set email alerts
|

A New Efficient Approach to Search for All Multi-State Minimal Cuts

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
35
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 57 publications
(35 citation statements)
references
References 29 publications
0
35
0
Order By: Relevance
“…To identify and remove a duplicate, below we show how to use a data structure recently proposed by Forghani-elahabad and Mahdavi-Amiri [21].…”
Section: An Efficient Approach To Determine Non-minimal Candidatesmentioning
confidence: 99%
See 4 more Smart Citations
“…To identify and remove a duplicate, below we show how to use a data structure recently proposed by Forghani-elahabad and Mahdavi-Amiri [21].…”
Section: An Efficient Approach To Determine Non-minimal Candidatesmentioning
confidence: 99%
“…We know r þ 1 is the number of all the Γ vectors obtained by using Lemma 3. Hence, the time complexity of using the data structure provided in [21] for removing the duplicate vectors is Oðr log ðrÞÞ. Now that we know how to determine the policy vectors, calculate the corresponding state vectors, and remove the nonminimal vectors and of course the duplicate minimal ones, we are at a position to present our algorithm.…”
Section: An Efficient Approach To Determine Non-minimal Candidatesmentioning
confidence: 99%
See 3 more Smart Citations