2023
DOI: 10.1007/s13198-023-01930-3
|View full text |Cite
|
Sign up to set email alerts
|

An intelligent node labelling maximum flow algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 25 publications
0
1
0
Order By: Relevance
“…The algorithm was evaluated on two case studies thus, Pyigyitagon Township network and 14-Bus electricity network. Tawanda et al [15] presented an exact intelligent node labelling maximum flow algorithm that determines maximum flow in any given WSN in two steps. Tawanda et al [16] proposed a matrix based extreme min-cut max-flow algorithm to calculate maximum flow value without making used of augmenting paths.…”
Section: Literature Reviewmentioning
confidence: 99%
“…The algorithm was evaluated on two case studies thus, Pyigyitagon Township network and 14-Bus electricity network. Tawanda et al [15] presented an exact intelligent node labelling maximum flow algorithm that determines maximum flow in any given WSN in two steps. Tawanda et al [16] proposed a matrix based extreme min-cut max-flow algorithm to calculate maximum flow value without making used of augmenting paths.…”
Section: Literature Reviewmentioning
confidence: 99%