Degree-five Steiner points cannot reduce network costs for planar sets.
- Published in:
- Networks, 1992, v. 22, n. 6, p. 531, doi. 10.1002/net.3230220604
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 1992 AND VI 22 AND IP 6
Results: 8
1
2
Scheduling file transfers in fully connected networks.
- Published in:
- Networks, 1992, v. 22, n. 6, p. 563, doi. 10.1002/net.3230220606
- By:
- Publication type:
- Article
3
On a tree-shaped facility location problem of Minieka.
- Published in:
- Networks, 1992, v. 22, n. 6, p. 515, doi. 10.1002/net.3230220602
- By:
- Publication type:
- Article
4
Masthead.
- Published in:
- Networks, 1992, v. 22, n. 6, p. fmi, doi. 10.1002/net.3230220601
- Publication type:
- Article
5
Parallel contractions of grids for task assignment to processor networks.
- Published in:
- Networks, 1992, v. 22, n. 6, p. 539, doi. 10.1002/net.3230220605
- By:
- Publication type:
- Article
6
Series-parallel subgraphs of planar graphs.
- Published in:
- Networks, 1992, v. 22, n. 6, p. 607, doi. 10.1002/net.3230220608
- By:
- Publication type:
- Article
7
Shortest path problems with node failures.
- Published in:
- Networks, 1992, v. 22, n. 6, p. 589, doi. 10.1002/net.3230220607
- By:
- Publication type:
- Article
8
An explicit construction of Euler circuits in shuffle nets and related networks.
- Published in:
- Networks, 1992, v. 22, n. 6, p. 523, doi. 10.1002/net.3230220603
- By:
- Publication type:
- Article