2020
DOI: 10.1016/j.cie.2020.106365
|View full text |Cite
|
Sign up to set email alerts
|

Solution of minimum spanning forest problems with reliability constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(1 citation statement)
references
References 61 publications
0
1
0
Order By: Relevance
“…In scenarios where all the spanning trees are interconnected, every node within the undirected graph G is incorporated into one of these spanning trees, as emphasized in [22]. Conversely, when a disconnected graph comprises multiple linked segments, it assembles a spanning forest, encompassing a spanning tree for each of these individual components, as highlighted in [23]. In Figure 2b, we can observe a spanning forest that formed due to removal of two other edges (2-3 and 3-10) in the previously depicted spanning tree in Figure 2a.…”
Section: Spanning Forestmentioning
confidence: 99%
“…In scenarios where all the spanning trees are interconnected, every node within the undirected graph G is incorporated into one of these spanning trees, as emphasized in [22]. Conversely, when a disconnected graph comprises multiple linked segments, it assembles a spanning forest, encompassing a spanning tree for each of these individual components, as highlighted in [23]. In Figure 2b, we can observe a spanning forest that formed due to removal of two other edges (2-3 and 3-10) in the previously depicted spanning tree in Figure 2a.…”
Section: Spanning Forestmentioning
confidence: 99%