|
|
Journals in DBLP
Networks
2004, volume: 44, number: 4
- Massimiliano Caramia, Paolo Dell'Olmo
Bounding vertex coloring by truncated multistage branch and bound. [Citation Graph (0, 0)][DBLP]
Networks, 2004, v:44, n:4, pp:231-242 [Journal]
- Ján Plesník
Minimum k-geodetically connected digraphs. [Citation Graph (0, 0)][DBLP]
Networks, 2004, v:44, n:4, pp:243-253 [Journal]
- Luis Gouveia, Thomas L. Magnanti, Cristina Requejo
A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees. [Citation Graph (0, 0)][DBLP]
Networks, 2004, v:44, n:4, pp:254-265 [Journal]
- Alberto Caprara, Andrea Lodi, Romeo Rizzi
On d-threshold graphs and d-dimensional bin packing. [Citation Graph (0, 0)][DBLP]
Networks, 2004, v:44, n:4, pp:266-280 [Journal]
- Frédéric Havet, Marc Wennink
The Push Tree problem. [Citation Graph (0, 0)][DBLP]
Networks, 2004, v:44, n:4, pp:281-291 [Journal]
- Min Xu, Xin-Min Hou, Jun-Ming Xu
The proof of a conjecture of Bouabdallah and Sotteau. [Citation Graph (0, 0)][DBLP]
Networks, 2004, v:44, n:4, pp:292-296 [Journal]
- Satoru Iwata, Nozomu Zuiki
A network flow approach to cost allocation for rooted trees. [Citation Graph (0, 0)][DBLP]
Networks, 2004, v:44, n:4, pp:297-301 [Journal]
- Jou-Ming Chang, Jinn-Shyong Yang, Yue-Li Wang, Yuwen Cheng
Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs. [Citation Graph (0, 0)][DBLP]
Networks, 2004, v:44, n:4, pp:302-310 [Journal]
|
