Divide-and-conquer algorithms for graph-layout problems.
- Published in:
- Networks, 1996, v. 28, n. 2, p. 69, doi. 10.1002/(SICI)1097-0037(199609)28:2<69::AID-NET1>3.0.CO;2-A
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 1996 AND VI 28 AND IP 2
Results: 6
1
2
Solving the dynamic facility location problem.
- Published in:
- Networks, 1996, v. 28, n. 2, p. 117, doi. 10.1002/(SICI)1097-0037(199609)28:2<117::AID-NET5>3.0.CO;2-H
- By:
- Publication type:
- Article
3
Network decomposition of general financial equilibria with transaction costs.
- Published in:
- Networks, 1996, v. 28, n. 2, p. 107, doi. 10.1002/(SICI)1097-0037(199609)28:2<107::AID-NET4>3.0.CO;2-I
- By:
- Publication type:
- Article
4
Masthead.
- Published in:
- Networks, 1996, v. 28, n. 2, p. fmi, doi. 10.1002/1097-0037(199609)28:2<::AID-NET3230280201>3.0.CO;2-J
- Publication type:
- Article
5
On the connectivity and the conditional diameter of graphs and digraphs.
- Published in:
- Networks, 1996, v. 28, n. 2, p. 97, doi. 10.1002/(SICI)1097-0037(199609)28:2<97::AID-NET3>3.0.CO;2-7
- By:
- Publication type:
- Article
6
Minimizing message complexity of partially replicated data on hypercubes.
- Published in:
- Networks, 1996, v. 28, n. 2, p. 87, doi. 10.1002/(SICI)1097-0037(199609)28:2<87::AID-NET2>3.0.CO;2-8
- By:
- Publication type:
- Article