An extremal problem on the connectivity of graphs.
- Published in:
- Networks, 1984, v. 14, n. 2, p. 337, doi. 10.1002/net.3230140210
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 1984 AND VI 14 AND IP 2
Results: 11
1
2
Synthesis of directed multicommodity flow networks.
- Published in:
- Networks, 1984, v. 14, n. 2, p. 213, doi. 10.1002/net.3230140203
- By:
- Publication type:
- Article
3
Sorting algorithms for the implementation of a generalized vector product.
- Published in:
- Networks, 1984, v. 14, n. 2, p. 269, doi. 10.1002/net.3230140207
- By:
- Publication type:
- Article
4
On minimal-node-cost planar embeddings.
- Published in:
- Networks, 1984, v. 14, n. 2, p. 181, doi. 10.1002/net.3230140202
- By:
- Publication type:
- Article
5
Shortest-path methods: Complexity, interrelations and new propositions.
- Published in:
- Networks, 1984, v. 14, n. 2, p. 257, doi. 10.1002/net.3230140206
- By:
- Publication type:
- Article
6
Masthead.
- Published in:
- Networks, 1984, v. 14, n. 2, p. fmi, doi. 10.1002/net.3230140201
- Publication type:
- Article
7
The period routing problem.
- Published in:
- Networks, 1984, v. 14, n. 2, p. 237, doi. 10.1002/net.3230140205
- By:
- Publication type:
- Article
8
A quick method for finding shortest pairs of disjoint paths.
- Published in:
- Networks, 1984, v. 14, n. 2, p. 325, doi. 10.1002/net.3230140209
- By:
- Publication type:
- Article
9
On computing the connectivities of graphs and digraphs.
- Published in:
- Networks, 1984, v. 14, n. 2, p. 355, doi. 10.1002/net.3230140211
- By:
- Publication type:
- Article
10
On multicommodity flows in planar graphs.
- Published in:
- Networks, 1984, v. 14, n. 2, p. 225, doi. 10.1002/net.3230140204
- By:
- Publication type:
- Article
11
Shortest-path algorithms: Taxonomy and annotation.
- Published in:
- Networks, 1984, v. 14, n. 2, p. 275, doi. 10.1002/net.3230140208
- By:
- Publication type:
- Article