Works matching IS 00283045 AND DT 1997 AND VI 29 AND IP 4

Results: 7

Edge coloring a k-tree into two smaller trees.

Published in:

Networks, 1997, v. 29, n. 4, p. 191, doi. 10.1002/(SICI)1097-0037(199707)29:4<191::AID-NET1>3.0.CO;2-A

By:

Chhajed, Dilip

Publication type:

Article

Layered cross product&mdashA technique to construct interconnection networks.

Published in:

Networks, 1997, v. 29, n. 4, p. 219, doi. 10.1002/(SICI)1097-0037(199707)29:4<219::AID-NET5>3.0.CO;2-I

By:

Even, Shimon;
Litman, Ami

Publication type:

Article

An infinite class of reach-preservable graphs.

Published in:

Networks, 1997, v. 29, n. 4, p. 217, doi. 10.1002/(SICI)1097-0037(199707)29:4<217::AID-NET4>3.0.CO;2-I

By:

Gagliardi, Daniel;
Lewinter, Marty

Publication type:

Article

Restricted delivery problems on a network.

Published in:

Networks, 1997, v. 29, n. 4, p. 205, doi. 10.1002/(SICI)1097-0037(199707)29:4<205::AID-NET3>3.0.CO;2-J

By:

Arkin, Esther M.;
Hassin, Refael;
Klein, Limor

Publication type:

Article

Constructing a bipartite graph of maximum connectivity with prescribed degrees.

Published in:

Networks, 1997, v. 29, n. 4, p. 245, doi. 10.1002/(SICI)1097-0037(199707)29:4<245::AID-NET7>3.0.CO;2-F

By:

Asano, Takao

Publication type:

Article

Reliability analysis of replicated and-or graphs.

Published in:

Networks, 1997, v. 29, n. 4, p. 195, doi. 10.1002/(SICI)1097-0037(199707)29:4<195::AID-NET2>3.0.CO;2-A

By:

Liang, De-Ron;
Jan, Rong-Hong;
Tripathi, Satish K.

Publication type:

Article

A computationally efficient method for nonlinear multicommodity network flow problems.

Published in:

Networks, 1997, v. 29, n. 4, p. 225, doi. 10.1002/(SICI)1097-0037(199707)29:4<225::AID-NET6>3.0.CO;2-H

By:

Lin, Shin-Yeu;
Lin, Ch'i-Hsin

Publication type:

Article