Node-disjoint paths and related problems on hierarchical cubic networks.
- Published in:
- Networks, 2002, v. 40, n. 3, p. 142, doi. 10.1002/net.10040
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2002 AND VI 40 AND IP 3
Results: 6
1
2
Solving partial constraint satisfaction problems with tree decomposition.
- Published in:
- Networks, 2002, v. 40, n. 3, p. 170, doi. 10.1002/net.10046
- By:
- Publication type:
- Article
3
Isomorphisms of the De Bruijn digraph and free-space optical networks.
- Published in:
- Networks, 2002, v. 40, n. 3, p. 155, doi. 10.1002/net.10043
- By:
- Publication type:
- Article
4
Network fair bandwidth share using hash rate estimation.
- Published in:
- Networks, 2002, v. 40, n. 3, p. 125, doi. 10.1002/net.10041
- By:
- Publication type:
- Article
5
Increasing the connectivity of the star graphs.
- Published in:
- Networks, 2002, v. 40, n. 3, p. 165, doi. 10.1002/net.10045
- By:
- Publication type:
- Article
6
Minimax problems with bitonic matrices.
- Published in:
- Networks, 2002, v. 40, n. 3, p. 113, doi. 10.1002/net.10038
- By:
- Publication type:
- Article