Networks

September 1996

Volume 28, Issue 2

Pages fmi–fmi, 69–124

Select All

Masthead
1. Top of page
2. Masthead
1. Masthead (page fmi)
  Article first published online: 23 MAR 2007 | DOI: 10.1002/1097-0037(199609)28:2<::AID-NET3230280201>3.0.CO;2-J
1. Divide-and-conquer algorithms for graph-layout problems (pages 69–85)
  Ram Swaminathan
  Article first published online: 7 DEC 1998 | DOI: 10.1002/(SICI)1097-0037(199609)28:2<69::AID-NET1>3.0.CO;2-A
2. Minimizing message complexity of partially replicated data on hypercubes (pages 87–95)
  Keith Humenik, Peter Matthews, A. B. Stephens and Yelena Yesha
  Article first published online: 7 DEC 1998 | DOI: 10.1002/(SICI)1097-0037(199609)28:2<87::AID-NET2>3.0.CO;2-8
3. On the connectivity and the conditional diameter of graphs and digraphs (pages 97–105)
  C. Balbuena, A. Carmona, J. Fàbrega and M. A. Fiol
  Article first published online: 7 DEC 1998 | DOI: 10.1002/(SICI)1097-0037(199609)28:2<97::AID-NET3>3.0.CO;2-7
4. Network decomposition of general financial equilibria with transaction costs (pages 107–116)
  Anna Nagurney and June Dong
  Article first published online: 7 DEC 1998 | DOI: 10.1002/(SICI)1097-0037(199609)28:2<107::AID-NET4>3.0.CO;2-I
5. Solving the dynamic facility location problem (pages 117–124)
  Pierre Chardaire, Alain Sutter and Marie-Christine Costa
  Article first published online: 7 DEC 1998 | DOI: 10.1002/(SICI)1097-0037(199609)28:2<117::AID-NET5>3.0.CO;2-H

Select All