Issue Information.
- Published in:
- Networks, 2017, v. 69, n. 4, p. 347, doi. 10.1002/net.21705
- Publication type:
- Article
Works matching IS 00283045 AND DT 2017 AND VI 69 AND IP 4
Results: 6
1
2
A recursive formula for the two-edge connected and biconnected reliability of a complete graph.
- Published in:
- Networks, 2017, v. 69, n. 4, p. 408, doi. 10.1002/net.21744
- By:
- Publication type:
- Article
3
Approaches for finding cohesive subgroups in large-scale social networks via maximum k-plex detection.
- Published in:
- Networks, 2017, v. 69, n. 4, p. 388, doi. 10.1002/net.21745
- By:
- Publication type:
- Article
4
Zone-based tariff design in public transportation networks.
- Published in:
- Networks, 2017, v. 69, n. 4, p. 349, doi. 10.1002/net.21731
- By:
- Publication type:
- Article
5
Two extended formulations for cardinality maximum flow network interdiction problem.
- Published in:
- Networks, 2017, v. 69, n. 4, p. 367, doi. 10.1002/net.21732
- By:
- Publication type:
- Article
6
Hardness and approximation for network flow interdiction.
- Published in:
- Networks, 2017, v. 69, n. 4, p. 378, doi. 10.1002/net.21739
- By:
- Publication type:
- Article