Discounted average degree density metric and new algorithms for the densest subgraph problem.
- Published in:
- Networks, 2018, v. 71, n. 1, p. 3, doi. 10.1002/net.21764
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2018 AND VI 71 AND IP 1
Results: 7
1
2
Network design with probabilistic capacities.
- Published in:
- Networks, 2018, v. 71, n. 1, p. 16, doi. 10.1002/net.21769
- By:
- Publication type:
- Article
3
Polyhedral results, branch-and-cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem.
- Published in:
- Networks, 2018, v. 71, n. 1, p. 31, doi. 10.1002/net.21787
- By:
- Publication type:
- Article
4
Optimal and heuristic network coding algorithms for multi-layered video broadcast.
- Published in:
- Networks, 2018, v. 71, n. 1, p. 51, doi. 10.1002/net.21788
- By:
- Publication type:
- Article
5
Issue Information.
- Published in:
- Networks, 2018, v. 71, n. 1, p. 1, doi. 10.1002/net.21770
- Publication type:
- Article
6
Multiple searchers searching for a randomly distributed immobile target on a unit network.
- Published in:
- Networks, 2018, v. 71, n. 1, p. 60, doi. 10.1002/net.21793
- By:
- Publication type:
- Article
7
Safe sets, network majority on weighted trees.
- Published in:
- Networks, 2018, v. 71, n. 1, p. 81, doi. 10.1002/net.21794
- By:
- Publication type:
- Article