New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts.
- Published in:
- Networks, 2022, v. 79, n. 2, p. 202, doi. 10.1002/net.22056
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2022 AND VI 79 AND IP 2
Results: 8
1
2
On the Complexity of Computing Maximum and Minimum Min‐Cost‐Flows.
- Published in:
- Networks, 2022, v. 79, n. 2, p. 236, doi. 10.1002/net.22060
- Publication type:
- Article
3
Finding minimum label spanning trees using cross‐entropy method.
- Published in:
- Networks, 2022, v. 79, n. 2, p. 220, doi. 10.1002/net.22057
- Publication type:
- Article
4
The node cop‐win reliability of unicyclic and bicyclic graphs.
- Published in:
- Networks, 2022, v. 79, n. 2, p. 189, doi. 10.1002/net.22055
- By:
- Publication type:
- Article
5
Approximation algorithms for Steiner forest: An experimental study.
- Published in:
- Networks, 2022, v. 79, n. 2, p. 164, doi. 10.1002/net.22046
- By:
- Publication type:
- Article
6
Optimal hierarchical clustering on a graph.
- Published in:
- Networks, 2022, v. 79, n. 2, p. 143, doi. 10.1002/net.22043
- By:
- Publication type:
- Article
7
Issue Information.
- Published in:
- Networks, 2022, v. 79, n. 2, p. 117, doi. 10.1002/net.22048
- Publication type:
- Article
8
A multi‐vehicle covering tour problem with speed optimization.
- Published in:
- Networks, 2022, v. 79, n. 2, p. 119, doi. 10.1002/net.22041
- By:
- Publication type:
- Article