A novel pseudo‐polynomial approach for shortest path problems.
- Published in:
- Networks, 2021, v. 78, n. 2, p. 107, doi. 10.1002/net.22027
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2021 AND VI 78 AND IP 2
Results: 8
1
2
Generating large scale‐free networks with the Chung–Lu random graph model.
- Published in:
- Networks, 2021, v. 78, n. 2, p. 174, doi. 10.1002/net.22012
- By:
- Publication type:
- Article
3
Controller placement problem in software‐defined networking: A survey.
- Published in:
- Networks, 2021, v. 78, n. 2, p. 195, doi. 10.1002/net.22016
- By:
- Publication type:
- Article
4
Unimodal eccentricity in trees.
- Published in:
- Networks, 2021, v. 78, n. 2, p. 188, doi. 10.1002/net.22013
- By:
- Publication type:
- Article
5
Deciding feasibility of a booking in the European gas market on a cycle is in P for the case of passive networks.
- Published in:
- Networks, 2021, v. 78, n. 2, p. 128, doi. 10.1002/net.22003
- By:
- Publication type:
- Article
6
The Gross–Saccoman conjecture is true.
- Published in:
- Networks, 2021, v. 78, n. 2, p. 164, doi. 10.1002/net.22006
- Publication type:
- Article
7
Roots of two‐terminal reliability polynomials.
- Published in:
- Networks, 2021, v. 78, n. 2, p. 153, doi. 10.1002/net.22004
- By:
- Publication type:
- Article
8
Issue Information.
- Published in:
- Networks, 2021, v. 78, n. 2, p. 105, doi. 10.1002/net.21955
- Publication type:
- Article