A branch and cut method for the degree-constrained minimum spanning tree problem.
- Published in:
- Networks, 2001, v. 37, n. 2, p. 74, doi. 10.1002/1097-0037(200103)37:2<74::AID-NET2>3.0.CO;2-E
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2001 AND VI 37 AND IP 2
Results: 6
1
2
Minimizing drop cost for SONET/WDM networks with ⅛ wavelength requirements.
- Published in:
- Networks, 2001, v. 37, n. 2, p. 107, doi. 10.1002/1097-0037(200103)37:2<107::AID-NET6>3.0.CO;2-A
- By:
- Publication type:
- Article
3
How hard is it to determine if a graph has a 2-role assignment?
- Published in:
- Networks, 2001, v. 37, n. 2, p. 67, doi. 10.1002/1097-0037(200103)37:2<67::AID-NET1>3.0.CO;2-9
- By:
- Publication type:
- Article
4
Scattering number in graphs.
- Published in:
- Networks, 2001, v. 37, n. 2, p. 102, doi. 10.1002/1097-0037(200103)37:2<102::AID-NET5>3.0.CO;2-S
- By:
- Publication type:
- Article
5
Improved upper and lower bounds for k-broadcasting.
- Published in:
- Networks, 2001, v. 37, n. 2, p. 94, doi. 10.1002/1097-0037(200103)37:2<94::AID-NET4>3.0.CO;2-6
- By:
- Publication type:
- Article
6
Embedding longest fault-free paths in arrangement graphs with faulty vertices.
- Published in:
- Networks, 2001, v. 37, n. 2, p. 84, doi. 10.1002/1097-0037(200103)37:2<84::AID-NET3>3.0.CO;2-A
- By:
- Publication type:
- Article