A model of self-avoiding random walks for searching complex networks.
- Published in:
- Networks, 2012, v. 60, n. 2, p. 71, doi. 10.1002/net.20461
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2012 AND VI 60 AND IP 2
Results: 6
1
2
Margining option portfolios by network flows.
- Published in:
- Networks, 2012, v. 60, n. 2, p. 120, doi. 10.1002/net.20465
- By:
- Publication type:
- Article
3
Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs.
- Published in:
- Networks, 2012, v. 60, n. 2, p. 103, doi. 10.1002/net.20464
- By:
- Publication type:
- Article
4
The ℓ<sub>p</sub>-function on trees.
- Published in:
- Networks, 2012, v. 60, n. 2, p. 94, doi. 10.1002/net.20463
- By:
- Publication type:
- Article
5
Constructing optimal subnetworks for the crossed cube network.
- Published in:
- Networks, 2012, v. 60, n. 2, p. 86, doi. 10.1002/net.20462
- By:
- Publication type:
- Article
6
Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty.
- Published in:
- Networks, 2012, v. 60, n. 2, p. 132, doi. 10.1002/net.21461
- By:
- Publication type:
- Article