Matchings in 3-vertex-critical graphs: The even case.
- Published in:
- Networks, 2005, v. 45, n. 4, p. 210, doi. 10.1002/net.20065
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2005 AND VI 45 AND IP 4
Results: 9
1
2
Lowering eccentricity of a tree by node upgrading.
- Published in:
- Networks, 2005, v. 45, n. 4, p. 232, doi. 10.1002/net.20069
- By:
- Publication type:
- Article
3
Minimizing the cost of placing and sizing wavelength division multiplexing and optical crossconnect equipment in a telecommunications network.
- Published in:
- Networks, 2005, v. 45, n. 4, p. 199, doi. 10.1002/net.20064
- By:
- Publication type:
- Article
4
Optimal broadcasting with universal lists based on competitive analysis.
- Published in:
- Networks, 2005, v. 45, n. 4, p. 224, doi. 10.1002/net.20068
- By:
- Publication type:
- Article
5
Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem.
- Published in:
- Networks, 2005, v. 45, n. 4, p. 195, doi. 10.1002/net.20063
- By:
- Publication type:
- Article
6
Minimal feedback vertex sets in directed split-stars.
- Published in:
- Networks, 2005, v. 45, n. 4, p. 218, doi. 10.1002/net.20067
- By:
- Publication type:
- Article
7
A simple protocol for deniable authentication based on ElGamal cryptography.
- Published in:
- Networks, 2005, v. 45, n. 4, p. 193, doi. 10.1002/net.20062
- By:
- Publication type:
- Article
8
Greedy approximation algorithms for directed multicuts.
- Published in:
- Networks, 2005, v. 45, n. 4, p. 214, doi. 10.1002/net.20066
- By:
- Publication type:
- Article
9
Exact solution of the centralized network design problem on directed graphs.
- Published in:
- Networks, 2005, v. 45, n. 4, p. 181, doi. 10.1002/net.20061
- By:
- Publication type:
- Article