Result 1 to 20 of 1623 total
Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty. (English)
Networks 60, No. 2, 132-139 (2012).
1
Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs. (English)
Networks 60, No. 2, 103-119 (2012).
2
The $\ell_{p}$-function on trees. (English)
Networks 60, No. 2, 94-102 (2012).
3
Constructing optimal subnetworks for the crossed cube network. (English)
Networks 60, No. 2, 86-93 (2012).
4
A model of self-avoiding random walks for searching complex networks. (English)
Networks 60, No. 2, 71-85 (2012).
5
Completely independent spanning trees in torus networks. (English)
Networks 60, No. 1, 59-69 (2012).
6
Deception tactics for network interdiction: a multiobjective approach. (English)
Networks 60, No. 1, 45-58 (2012).
7
On Stackelberg pricing with computationally bounded customers. (English)
Networks 60, No. 1, 31-44 (2012).
8
Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks. (English)
Networks 60, No. 1, 19-30 (2012).
9
Models and heuristics for the $k$-degree constrained minimum spanning tree problem with node-degree costs. (English)
Networks 60, No. 1, 1-18 (2012).
10
Coverings and matchings in $r$-partite hypergraphs. (English)
Networks 59, No. 4, 400-410 (2012).
11
A branch-and-cut algorithm for the preemptive swapping problem. (English)
Networks 59, No. 4, 387-399 (2012).
12
Computing approximate Nash equilibria in network congestion games. (English)
Networks 59, No. 4, 380-386 (2012).
13
Reload cost trees and network design. (English)
Networks 59, No. 4, 365-379 (2012).
14
Matching preclusion and conditional matching preclusion for bipartite interconnection networks. II: Cayley graphs generated by transposition trees and hyper-stars. (English)
Networks 59, No. 4, 357-364 (2012).
15
Matching preclusion and conditional matching preclusion for bipartite interconnection networks. I: Sufficient conditions. (English)
Networks 59, No. 4, 349-356 (2012).
16
Deterministic rendezvous in networks: a comprehensive survey. (English)
Networks 59, No. 3, 331-347 (2012).
17
A mobility model for studying wireless communication and the complexity of problems in the model. (English)
Networks 59, No. 3, 320-330 (2012).
18
Localization and scheduling protocols for actor-centric sensor networks. (English)
Networks 59, No. 3, 299-319 (2012).
19
Optimal gossiping in geometric radio networks in the presence of dynamical faults. (English)
Networks 59, No. 3, 289-298 (2012).
20
Result 1 to 20 of 1623 total
Start
Contact
Print
General Help
