Navigating free‐floating minefields via time‐varying Voronoi graphs.
- Published in:
- Networks, 2019, v. 73, n. 2, p. 254, doi. 10.1002/net.21860
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2019 AND VI 73 AND IP 2
Results: 7
1
2
Optimizing ground station networks for free space optical communications: Maximizing the data transfer.
- Published in:
- Networks, 2019, v. 73, n. 2, p. 234, doi. 10.1002/net.21859
- By:
- Publication type:
- Article
3
Reduction techniques for the prize collecting Steiner tree problem and the maximum‐weight connected subgraph problem.
- Published in:
- Networks, 2019, v. 73, n. 2, p. 206, doi. 10.1002/net.21857
- By:
- Publication type:
- Article
4
An exact bidirectional A<sup>⋆</sup> approach for solving resource‐constrained shortest path problems.
- Published in:
- Networks, 2019, v. 73, n. 2, p. 187, doi. 10.1002/net.21856
- By:
- Publication type:
- Article
5
A decomposition approach to solve the selective graph coloring problem in some perfect graph families.
- Published in:
- Networks, 2019, v. 73, n. 2, p. 145, doi. 10.1002/net.21850
- By:
- Publication type:
- Article
6
Algorithms and complexity of range clustering.
- Published in:
- Networks, 2019, v. 73, n. 2, p. 170, doi. 10.1002/net.21854
- By:
- Publication type:
- Article
7
Issue Information.
- Published in:
- Networks, 2019, v. 73, n. 2, p. 143, doi. 10.1002/net.21838
- Publication type:
- Article