Found: 8
Select item for more details and to access through your institution.
On optimal orientations of Cartesian products of even cycles and paths.
- Published in:
- Networks, 1997, v. 30, n. 1, p. 1, doi. 10.1002/(SICI)1097-0037(199708)30:1<1::AID-NET1>3.0.CO;2-H
- By:
- Publication type:
- Article
State space partitioning methods for stochastic shortest path problems.
- Published in:
- Networks, 1997, v. 30, n. 1, p. 9, doi. 10.1002/(SICI)1097-0037(199708)30:1<9::AID-NET2>3.0.CO;2-H
- By:
- Publication type:
- Article
Maximizing spanning trees in almost complete graphs.
- Published in:
- Networks, 1997, v. 30, n. 1, p. 23, doi. 10.1002/(SICI)1097-0037(199708)30:1<23::AID-NET3>3.0.CO;2-N
- By:
- Publication type:
- Article
Locating replicas of a database on a network.
- Published in:
- Networks, 1997, v. 30, n. 1, p. 31, doi. 10.1002/(SICI)1097-0037(199708)30:1<31::AID-NET4>3.0.CO;2-M
- By:
- Publication type:
- Article
Linear time algorithms for computing the most reliable source on an unreliable tree network.
- Published in:
- Networks, 1997, v. 30, n. 1, p. 37, doi. 10.1002/(SICI)1097-0037(199708)30:1<37::AID-NET5>3.0.CO;2-M
- By:
- Publication type:
- Article
On the asymptotic behavior of the maximum number of spanning trees in circulant graphs.
- Published in:
- Networks, 1997, v. 30, n. 1, p. 47, doi. 10.1002/(SICI)1097-0037(199708)30:1<47::AID-NET6>3.0.CO;2-L
- By:
- Publication type:
- Article
Commodity family extended formulations of uncapacitated fixed charge network flow problems.
- Published in:
- Networks, 1997, v. 30, n. 1, p. 57, doi. 10.1002/(SICI)1097-0037(199708)30:1<57::AID-NET7>3.0.CO;2-K
- By:
- Publication type:
- Article
Introduction to graph theory.
- Published in:
- Networks, 1997, v. 30, n. 1, p. 73, doi. 10.1002/(SICI)1097-0037(199708)30:1<73::AID-NET8>3.0.CO;2-I
- By:
- Publication type:
- Article