Volume 37; Issue 3

Networks

Volume 37; Issue 3
1

Homogeneous sets and domination: A linear time algorithm for distance—hereditary graphs

Falk Nicolai, Thomas Szymczak
Journal:
Networks
Year:
2001
Language:
english
File:
PDF, 210 KB
english, 2001
2

On the number of spanning trees in directed circulant graphs

Zbigniew Lonc, Krzysztof Parol, Jacek M. Wojciechowski
Journal:
Networks
Year:
2001
Language:
english
File:
PDF, 117 KB
english, 2001
3

The capacitated arc routing problem with intermediate facilities

Gianpaolo Ghiani, Gennaro Improta, Gilbert Laporte
Journal:
Networks
Year:
2001
Language:
english
File:
PDF, 150 KB
english, 2001
5

Minimum spanners of butterfly graphs

Shien-Ching Hwang, Gen-Huey Chen
Journal:
Networks
Year:
2001
Language:
english
File:
PDF, 251 KB
english, 2001
6

On the construction of combined k-fault-tolerant Hamiltonian graphs

Chun-Nan Hung, Lih-Hsing Hsu, Ting-Yi Sung
Journal:
Networks
Year:
2001
Language:
english
File:
PDF, 140 KB
english, 2001