More reliable graphs are not always stronger.
- Published in:
- Networks, 2023, v. 81, n. 4, p. 490, doi. 10.1002/net.22141
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2023 AND VI 81 AND IP 4
Results: 6
1
2
A combinatorial branch and bound for the safe set problem.
- Published in:
- Networks, 2023, v. 81, n. 4, p. 445, doi. 10.1002/net.22140
- By:
- Publication type:
- Article
3
Maximum weight perfect matching problem with additional disjunctive conflict constraints.
- Published in:
- Networks, 2023, v. 81, n. 4, p. 465, doi. 10.1002/net.22139
- By:
- Publication type:
- Article
4
Network augmentation for disaster‐resilience against geographically correlated failure.
- Published in:
- Networks, 2023, v. 81, n. 4, p. 419, doi. 10.1002/net.22138
- By:
- Publication type:
- Article
5
On optimally solving sub‐tree scheduling for wireless sensor networks with partial coverage: A branch‐and‐cut algorithm.
- Published in:
- Networks, 2023, v. 81, n. 4, p. 499, doi. 10.1002/net.22145
- By:
- Publication type:
- Article
6
Issue Information.
- Published in:
- Networks, 2023, v. 81, n. 4, p. 417, doi. 10.1002/net.22105
- Publication type:
- Article