Works matching IS 00283045 AND DT 2008 AND VI 52 AND IP 4

Results: 17

Editorial: 2007 Glover-Klingman Prize winners.

Published in:

Networks, 2008, v. 52, n. 4, p. 179, doi. 10.1002/net.20273

By:

Golden, Bruce L.;
Shier, Douglas R.

Publication type:

Article

Competitive algorithms and lower bounds for online randomized call control in cellular networks.

Published in:

Networks, 2008, v. 52, n. 4, p. 235, doi. 10.1002/net.20244

By:

Caragiannis, Ioannis;
Kaklamanis, Christos;
Papaioannou, Evi

Publication type:

Article

On persistent directed graphs.

Published in:

Networks, 2008, v. 52, n. 4, p. 271, doi. 10.1002/net.20248

By:

Bang-Jensen, Jorgen;
Jordán, Tibor

Publication type:

Article

Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships.

Published in:

Networks, 2008, v. 52, n. 4, p. 287, doi. 10.1002/net.20250

By:

Christophe, Julie;
Dewez, Sophie;
Doignon, Jean-Paul;
Fasbender, Gilles;
Grégoire, Philippe;
Huygens, David;
Labbé, Martine;
Elloumi, Sourour;
Mélot, Hadrien;
Yaman, Hande

Publication type:

Article

Valid cycles: A source of infeasibility in open shortest path first routing.

Published in:

Networks, 2008, v. 52, n. 4, p. 206, doi. 10.1002/net.20232

By:

Broström, Peter;
Holmberg, Kaj

Publication type:

Article

Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles.

Published in:

Networks, 2008, v. 52, n. 4, p. 252, doi. 10.1002/net.20243

By:

Rautenbach, Dieter;
Volkmann, Lutz

Publication type:

Article

Lagrangian relaxation and enumeration for solving constrained shortest-path problems.

Published in:

Networks, 2008, v. 52, n. 4, p. 256, doi. 10.1002/net.20247

By:

Carlyle, W. Matthew;
Royset, Johannes O.;
Kevin Wood, R.

Publication type:

Article

Reliability of interconnection networks modeled by Cartesian product digraphs.

Published in:

Networks, 2008, v. 52, n. 4, p. 202, doi. 10.1002/net.20231

By:

Yang, Chao;
Xu, Jun-Ming

Publication type:

Article

A linear programming approach to increasing the weight of all minimum spanning trees.

Published in:

Networks, 2008, v. 52, n. 4, p. 227, doi. 10.1002/net.20242

By:

Baïou, Mourad;
Barahona, Francisco

Publication type:

Article

F-Chord: Improved uniform routing on Chord.

Published in:

Networks, 2008, v. 52, n. 4, p. 325, doi. 10.1002/net.20253

By:

Cordasco, G.;
Gargano, L.;
Negro, A.;
Scarano, V.;
Hammar, M.

Publication type:

Article

Multirate nonblocking multicast Log.

Published in:

Networks, 2008, v. 52, n. 4, p. 277, doi. 10.1002/net.20246

By:

Lin, Bey-Chi;
Lea, Chin-Tau

Publication type:

Article

On the diameter of the generalized undirected de Bruijn graphs UG.

Published in:

Networks, 2008, v. 52, n. 4, p. 180, doi. 10.1002/net.20228

By:

Kuo, Jyhmin;
Fu, Hung-Lin

Publication type:

Article

Conditional diameter saturated graphs.

Published in:

Networks, 2008, v. 52, n. 4, p. 196, doi. 10.1002/net.20230

By:

Balbuena, C.;
García-Vázquez, P.;
Marcote, X.;
Valenzuela, J.C.

Publication type:

Article

Grooming for two-period optical networks.

Published in:

Networks, 2008, v. 52, n. 4, p. 307, doi. 10.1002/net.20252

By:

Colbourn, Charles J.;
Quattrocchi, Gaetano;
Syrotiuk, Violet R.

Publication type:

Article

On the hardness of range assignment problems.

Published in:

Networks, 2008, v. 52, n. 4, p. 183, doi. 10.1002/net.20227

By:

Fuchs, Bernhard

Publication type:

Article

Lower bounds for two-period grooming via linear programming duality.

Published in:

Networks, 2008, v. 52, n. 4, p. 299, doi. 10.1002/net.20251

By:

Colbourn, Charles J.;
Quattrocchi, Gaetano;
Syrotiuk, Violet R.

Publication type:

Article

Approximation bounds for Black Hole Search problems.

Published in:

Networks, 2008, v. 52, n. 4, p. 216, doi. 10.1002/net.20233

By:

Klasing, Ralf;
Markou, Euripides;
Radzik, Tomasz;
Sarracco, Fabiano

Publication type:

Article