New upper bound on m-time-relaxed k-broadcast graphs.
- Published in:
- Networks, 2017, v. 70, n. 2, p. 72, doi. 10.1002/net.21749
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2017 AND VI 70 AND IP 2
Results: 7
1
2
Duality in convex minimum cost flow problems on infinite networks and hypernetworks.
- Published in:
- Networks, 2017, v. 70, n. 2, p. 98, doi. 10.1002/net.21754
- By:
- Publication type:
- Article
3
Quadratic unconstrained binary optimization problem preprocessing: Theory and empirical analysis.
- Published in:
- Networks, 2017, v. 70, n. 2, p. 79, doi. 10.1002/net.21751
- By:
- Publication type:
- Article
4
Editorial: 2016 Glover-Klingman Prize Winners.
- Published in:
- 2017
- By:
- Publication type:
- Editorial
5
Bounds on the fault-diameter of graphs.
- Published in:
- Networks, 2017, v. 70, n. 2, p. 132, doi. 10.1002/net.21758
- By:
- Publication type:
- Article
6
Computing cyclic invariants for molecular graphs.
- Published in:
- Networks, 2017, v. 70, n. 2, p. 116, doi. 10.1002/net.21757
- By:
- Publication type:
- Article
7
Issue Information.
- Published in:
- Networks, 2017, v. 70, n. 2, p. 69, doi. 10.1002/net.21707
- Publication type:
- Article