Total domination in graphs.
- Published in:
- Networks, 1980, v. 10, n. 3, p. 211, doi. 10.1002/net.3230100304
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 1980 AND VI 10 AND IP 3
Results: 8
1
2
Monotone sequences of graphical invariants.
- Published in:
- Networks, 1980, v. 10, n. 3, p. 273, doi. 10.1002/net.3230100308
- By:
- Publication type:
- Article
3
An algorithm for the traffic assignment problem.
- Published in:
- Networks, 1980, v. 10, n. 3, p. 197, doi. 10.1002/net.3230100303
- By:
- Publication type:
- Article
4
Conditional centers and medians of a graph.
- Published in:
- Networks, 1980, v. 10, n. 3, p. 265, doi. 10.1002/net.3230100307
- By:
- Publication type:
- Article
5
Efficient special case algorithms for the n-line planar traveling salesman problem.
- Published in:
- Networks, 1980, v. 10, n. 3, p. 183, doi. 10.1002/net.3230100302
- By:
- Publication type:
- Article
6
An algorithm for finding a short closed spanning walk in a graph.
- Published in:
- Networks, 1980, v. 10, n. 3, p. 249, doi. 10.1002/net.3230100306
- By:
- Publication type:
- Article
7
Masthead.
- Published in:
- Networks, 1980, v. 10, n. 3, p. fmi, doi. 10.1002/net.3230100301
- Publication type:
- Article
8
Optimal clustering structures for hierarchical topological design of large computer networks.
- Published in:
- Networks, 1980, v. 10, n. 3, p. 221, doi. 10.1002/net.3230100305
- By:
- Publication type:
- Article