Works matching IS 00283045 AND DT 1996 AND VI 27 AND IP 3

Results: 12

Broadcasting with universal lists.

Published in:

Networks, 1996, v. 27, n. 3, p. 183, doi. 10.1002/(SICI)1097-0037(199605)27:3<183::AID-NET3>3.0.CO;2-E

By:

Diks, Krzysztof;
Pelc, Andrzej

Publication type:

Article

A response to Volgenant's Addendum on the most vital edges.

Published in:

Networks, 1996, v. 27, n. 3, p. 255, doi. 10.1002/(SICI)1097-0037(199605)27:3<255::AID-NET10>3.0.CO;2-F

By:

Hung, Chun-Nan;
Hsu, Lih-Hsing;
Sung, Ting-Yi

Publication type:

Article

Star-factors and k-bounded total domination.

Published in:

Networks, 1996, v. 27, n. 3, p. 197, doi. 10.1002/(SICI)1097-0037(199605)27:3<197::AID-NET4>3.0.CO;2-D

By:

Gunther, Georg;
Hartnell, Bert;
Rall, Douglas

Publication type:

Article

Masthead.

Published in:: Networks, 1996, v. 27, n. 3, p. fmi, doi. 10.1002/1097-0037(199605)27:3<::AID-NET3230270301>3.0.CO;2-N
Publication type:: Article

Minimum gossip bus networks.

Published in:

Networks, 1996, v. 27, n. 3, p. 239, doi. 10.1002/(SICI)1097-0037(199605)27:3<239::AID-NET8>3.0.CO;2-J

By:

Fraigniaud, Pierre;
Laforest, Christian

Publication type:

Article

An addendum to the most vital edges of matching in a bipartite graph.

Published in:

Networks, 1996, v. 27, n. 3, p. 253, doi. 10.1002/(SICI)1097-0037(199605)27:3<253::AID-NET9>3.0.CO;2-H

By:

Volgenant, A.

Publication type:

Article

A single facility location problem on a tree with unreliable edges.

Published in:

Networks, 1996, v. 27, n. 3, p. 219, doi. 10.1002/(SICI)1097-0037(199605)27:3<219::AID-NET7>3.0.CO;2-L

By:

Melachrinoudis, Emanuel;
Helander, Mary E.

Publication type:

Article

Complexity of spanning tree problems with leaf-dependent objectives.

Published in:

Networks, 1996, v. 27, n. 3, p. 175, doi. 10.1002/(SICI)1097-0037(199605)27:3<175::AID-NET2>3.0.CO;2-F

By:

Dell'Amico, Mauro;
Labbé, Martine;
Maffioli, Francesco

Publication type:

Article

A simple O( n.

Published in:

Networks, 1996, v. 27, n. 3, p. 215, doi. 10.1002/(SICI)1097-0037(199605)27:3<215::AID-NET6>3.0.CO;2-L

By:

Mirchandani, Prakash

Publication type:

Article

A linear time algorithm to recognize circular permutation graphs.

Published in:

Networks, 1996, v. 27, n. 3, p. 171, doi. 10.1002/(SICI)1097-0037(199605)27:3<171::AID-NET1>3.0.CO;2-F

By:

Sritharan, R.

Publication type:

Article

Optimally edge fault-tolerant trees.

Published in:

Networks, 1996, v. 27, n. 3, p. 203, doi. 10.1002/(SICI)1097-0037(199605)27:3<203::AID-NET5>3.0.CO;2-M

By:

Ku, Hung-Kuei;
Hayes, John P.

Publication type:

Article

Aims and Scope.

Published in:: Networks, 1996, v. 27, n. 3, p. i, doi. 10.1002/1097-0037(199605)27:3<::AID-NET3230270302>3.0.CO;2-K
Publication type:: Article