Issue Information.
- Published in:
- Networks, 2020, v. 76, n. 3, p. 321, doi. 10.1002/net.21899
- Publication type:
- Article
Works matching IS 00283045 AND DT 2020 AND VI 76 AND IP 3
Results: 7
1
2
Most reliable two‐terminal graphs with node failures.
- Published in:
- Networks, 2020, v. 76, n. 3, p. 414, doi. 10.1002/net.21968
- By:
- Publication type:
- Article
3
Improved methods to compare distance metrics in networks using uniform random spanning trees (DIMECOST).
- Published in:
- Networks, 2020, v. 76, n. 3, p. 402, doi. 10.1002/net.21949
- By:
- Publication type:
- Article
4
The stochastic critical node problem over trees.
- Published in:
- Networks, 2020, v. 76, n. 3, p. 381, doi. 10.1002/net.21948
- By:
- Publication type:
- Article
5
An integer program for positive semidefinite zero forcing in graphs.
- Published in:
- Networks, 2020, v. 76, n. 3, p. 366, doi. 10.1002/net.21947
- By:
- Publication type:
- Article
6
Spanning tree modulus for secure broadcast games.
- Published in:
- Networks, 2020, v. 76, n. 3, p. 350, doi. 10.1002/net.21945
- By:
- Publication type:
- Article
7
The K‐partitioning problem: Formulations and branch‐and‐cut.
- Published in:
- Networks, 2020, v. 76, n. 3, p. 323, doi. 10.1002/net.21944
- By:
- Publication type:
- Article