Works matching IS 00283045 AND DT 1981 AND VI 11 AND IP 1

Results: 11

Mean flow scheduling and optimal construction of a treelike communication network.

Published in:

Networks, 1981, v. 11, n. 1, p. 87, doi. 10.1002/net.3230110111

By:

Perl, Yehoshua;
Yesha, Yaacov

Publication type:

Article

An O( n log n) heuristic for steiner minimal tree problems on the euclidean metric.

Published in:

Networks, 1981, v. 11, n. 1, p. 23, doi. 10.1002/net.3230110104

By:

Smith, J. Macgregor;
Lee, D. T.;
Liebman, Judith S.

Publication type:

Article

Covering and packing in graphs IV: Linear arboricity.

Published in:

Networks, 1981, v. 11, n. 1, p. 69, doi. 10.1002/net.3230110108

By:

Akiyama, Jin;
Exoo, Geoffrey;
Harary, Frank

Publication type:

Article

The complexity of designing a network with minimum diameter.

Published in:

Networks, 1981, v. 11, n. 1, p. 77, doi. 10.1002/net.3230110110

By:

Plesnik, J.

Publication type:

Article

On testing isomorphism of permutation graphs.

Published in:

Networks, 1981, v. 11, n. 1, p. 13, doi. 10.1002/net.3230110103

By:

Colbourn, Charles J.

Publication type:

Article

The cohesiveness of a point of a graph.

Published in:

Networks, 1981, v. 11, n. 1, p. 65, doi. 10.1002/net.3230110107

By:

Akiyama, Jin;
Boesch, Frank;
Era, Hiroshi;
Harary, Frank;
Tindell, Ralph

Publication type:

Article

A comparison of three algorithms for finding fundamental cycles in a directed graph.

Published in:

Networks, 1981, v. 11, n. 1, p. 1, doi. 10.1002/net.3230110102

By:

Ryan, Doris R.;
Chen, Stephen

Publication type:

Article

Graphs as models of communication network vulnerability: Connectivity and persistence.

Published in:

Networks, 1981, v. 11, n. 1, p. 57, doi. 10.1002/net.3230110106

By:

Boesch, Frank T.;
Harary, Frank;
Kabell, Jerald A.

Publication type:

Article

Masthead.

Published in:: Networks, 1981, v. 11, n. 1, p. fmi, doi. 10.1002/net.3230110101
Publication type:: Article

Sensitivity analysis of optimal matchings.

Published in:

Networks, 1981, v. 11, n. 1, p. 41, doi. 10.1002/net.3230110105

By:

Weber, G. M.

Publication type:

Article

A more compact formulation of the symmetric multiple traveling salesman problem with fixed charges.

Published in:

Networks, 1981, v. 11, n. 1, p. 73, doi. 10.1002/net.3230110109

By:

Discenza, Joseph Henry

Publication type:

Article