Superconnected digraphs and graphs with small conditional diameters.
- Published in:
- Networks, 2002, v. 39, n. 3, p. 153, doi. 10.1002/net.10020
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2002 AND VI 39 AND IP 3
Results: 6
1
2
Efficient algorithms for centers and medians in interval and circular-arc graphs.
- Published in:
- Networks, 2002, v. 39, n. 3, p. 144, doi. 10.1002/net.10023
- By:
- Publication type:
- Article
3
Exact algorithms for minimum routing cost trees.
- Published in:
- Networks, 2002, v. 39, n. 3, p. 161, doi. 10.1002/net.10022
- By:
- Publication type:
- Article
4
Light graphs with small routing cost.
- Published in:
- Networks, 2002, v. 39, n. 3, p. 130, doi. 10.1002/net.10019
- By:
- Publication type:
- Article
5
Worst-case incremental analysis for a class of p-facility location problems.
- Published in:
- Networks, 2002, v. 39, n. 3, p. 139, doi. 10.1002/net.10021
- By:
- Publication type:
- Article
6
Degree- and time-constrained broadcast networks.
- Published in:
- Networks, 2002, v. 39, n. 3, p. 121, doi. 10.1002/net.10018
- By:
- Publication type:
- Article