Eccentric graphs.
- Published in:
- Networks, 1999, v. 34, n. 2, p. 115, doi. 10.1002/(SICI)1097-0037(199909)34:2<115::AID-NET4>3.0.CO;2-K
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 1999 AND VI 34 AND IP 2
Results: 9
1
2
New large graphs with given degree and diameter six.
- Published in:
- Networks, 1999, v. 34, n. 2, p. 154, doi. 10.1002/(SICI)1097-0037(199909)34:2<154::AID-NET8>3.0.CO;2-7
- By:
- Publication type:
- Article
3
Analysis of LP relaxations for multiway and multicut problems.
- Published in:
- Networks, 1999, v. 34, n. 2, p. 102, doi. 10.1002/(SICI)1097-0037(199909)34:2<102::AID-NET3>3.0.CO;2-X
- By:
- Publication type:
- Article
4
Greedy online algorithms for routing permanent virtual circuits.
- Published in:
- Networks, 1999, v. 34, n. 2, p. 136, doi. 10.1002/(SICI)1097-0037(199909)34:2<136::AID-NET7>3.0.CO;2-6
- By:
- Publication type:
- Article
5
An efficient implementation of an algorithm for finding K shortest simple paths.
- Published in:
- Networks, 1999, v. 34, n. 2, p. 88, doi. 10.1002/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1
- By:
- Publication type:
- Article
6
On a condition for obtaining an explicit solution of optimum requirement spanning tree.
- Published in:
- Networks, 1999, v. 34, n. 2, p. 132, doi. 10.1002/(SICI)1097-0037(199909)34:2<132::AID-NET6>3.0.CO;2-L
- By:
- Publication type:
- Article
7
Optimal tree 3-spanners in directed path graphs.
- Published in:
- Networks, 1999, v. 34, n. 2, p. 81, doi. 10.1002/(SICI)1097-0037(199909)34:2<81::AID-NET1>3.0.CO;2-P
- By:
- Publication type:
- Article
8
Optimum requirement spanning trees and reliability of tree networks.
- Published in:
- Networks, 1999, v. 34, n. 2, p. 122, doi. 10.1002/(SICI)1097-0037(199909)34:2<122::AID-NET5>3.0.CO;2-P
- By:
- Publication type:
- Article
9
A tabu search heuristic for the Steiner Tree Problem.
- Published in:
- Networks, 1999, v. 34, n. 2, p. 162, doi. 10.1002/(SICI)1097-0037(199909)34:2<162::AID-NET9>3.0.CO;2-9
- By:
- Publication type:
- Article