Works matching IS 00283045 AND DT 1974 AND VI 4 AND IP 4

Results: 8

Computing capacitated minimal spanning trees efficiently.

Published in:

Networks, 1974, v. 4, n. 4, p. 299, doi. 10.1002/net.3230040403

By:

Kershenbaum, A.

Publication type:

Article

Algorithms on circular-arc graphs.

Published in:

Networks, 1974, v. 4, n. 4, p. 357, doi. 10.1002/net.3230040407

By:

Gavril, F.

Publication type:

Article

Control of an expanding network-'An operational nightmare'.

Published in:

Networks, 1974, v. 4, n. 4, p. 287, doi. 10.1002/net.3230040402

By:

Mauceri, L. J.

Publication type:

Article

An algorithm for nonlinear multicommodity flow problems.

Published in:

Networks, 1974, v. 4, n. 4, p. 343, doi. 10.1002/net.3230040406

By:

Klessig, R. W.

Publication type:

Article

Masthead.

Published in:: Networks, 1974, v. 4, n. 4, p. fmi, doi. 10.1002/net.3230040401
Publication type:: Article

A lower bound on the average shortest path length in regular graphs.

Published in:

Networks, 1974, v. 4, n. 4, p. 335, doi. 10.1002/net.3230040405

By:

Cerf, V. G.;
Cowan, D. D.;
Mullin, R. C.;
Stanton, R. G.

Publication type:

Article

Shortest alternating path algorithms.

Published in:

Networks, 1974, v. 4, n. 4, p. 311, doi. 10.1002/net.3230040404

By:

Brown, J. R.

Publication type:

Article

On clique-extremal (p,q)-graphs.

Published in:

Networks, 1974, v. 4, n. 4, p. 371, doi. 10.1002/net.3230040408

By:

Harary, F.;
Lempel, A.

Publication type:

Article