Nonblocking multirate log.
- Published in:
- Networks, 2011, v. 57, n. 4, p. 333, doi. 10.1002/net.20403
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2011 AND VI 57 AND IP 4
Results: 10
1
2
Finding integer efficient solutions for multiple objective network programming problems.
- Published in:
- Networks, 2011, v. 57, n. 4, p. 362, doi. 10.1002/net.20407
- By:
- Publication type:
- Article
3
Least central subtrees, center, and centroid of a tree.
- Published in:
- Networks, 2011, v. 57, n. 4, p. 328, doi. 10.1002/net.20402
- By:
- Publication type:
- Article
4
Optimum steiner ratio for gradient-constrained networks connecting three points in 3-space, part II: The gradient-constraint m satisfies.
- Published in:
- Networks, 2011, v. 57, n. 4, p. 354, doi. 10.1002/net.20406
- By:
- Publication type:
- Article
5
Editorial: 2009 Glover-Klingman Prize winners.
- Published in:
- Networks, 2011, v. 57, n. 4, p. 309, doi. 10.1002/net.20446
- By:
- Publication type:
- Article
6
On large (Δ, D, D, 1)-graphs.
- Published in:
- Networks, 2011, v. 57, n. 4, p. 316, doi. 10.1002/net.20401
- By:
- Publication type:
- Article
7
High-confidence estimation of small s- t reliabilities in directed acyclic networks.
- Published in:
- Networks, 2011, v. 57, n. 4, p. 376, doi. 10.1002/net.20412
- By:
- Publication type:
- Article
8
Balancing two spanning trees.
- Published in:
- Networks, 2011, v. 57, n. 4, p. 351, doi. 10.1002/net.20405
- By:
- Publication type:
- Article
9
Connectivity and diameter in distance graphs.
- Published in:
- Networks, 2011, v. 57, n. 4, p. 310, doi. 10.1002/net.20397
- By:
- Publication type:
- Article
10
Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries.
- Published in:
- Networks, 2011, v. 57, n. 4, p. 344, doi. 10.1002/net.20404
- By:
- Publication type:
- Article