Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 27
Volume 27, Number 1, January 1996
- John A. Ellis:
Embedding grids into grids: Techniques for large compression ratios. 1-17 - Frank Harary, John P. Hayes:
Node fault tolerance in graphs. 19-23 - Franco Blanchini, Maurice Queyranne, Franca Rinaldi, Walter Ukovich:
A feedback strategy for periodic network flows. 25-34 - Tein-Yaw Chung, Dharma P. Agrawal, Suresh Rai, Tzau J. Chung:
A comparative study of doubly connected directed topologies for LANs and MANs. 35-51 - Eckehart Hotzel:
Components and graph automorphisms of standard 2 x 2-switch banyan networks. 53-71 - Alice Underwood:
A modified Melzak procedure for computing node-weighted Steiner trees. 73-79 - Lloyd G. Greenwald, Thomas Dean:
Package routing in transportation networks with fixed vehicle schedules. 81-93
Volume 27, Number 2, March 1996
- Yves Nobert, Jean-Claude Picard:
An optimal algorithm for the mixed Chinese postman problem. 97-108 - Kalyan T. Talluri:
Network synthesis with few edges. 109-115 - Frieda Granot, Michal Penn, Maurice Queyranne:
Disconnecting sets in single and two-terminal-pair networks. 117-123 - Louis Petingi, John T. Saccoman, Laura Schoppmann:
Uniformly least reliable graphs. 125-131 - George H. Polychronopoulos, John N. Tsitsiklis:
Stochastic shortest path problems with recourse. 133-143 - Tung-Yang Ho, Lih-Hsing Hsu, Ting-Yi Sung:
Transmitting on various network topologies. 145-157 - Ju-Young Lee Park, Hyeong-Ah Choi:
Circuit-switched row-column broadcasting in torus and mesh networks. 159-167
Volume 27, Number 3, May 1996
- R. Sritharan:
A linear time algorithm to recognize circular permutation graphs. 171-174 - Mauro Dell'Amico, Martine Labbé, Francesco Maffioli:
Complexity of spanning tree problems with leaf-dependent objectives. 175-181 - Krzysztof Diks, Andrzej Pelc:
Broadcasting with universal lists. 183-196 - Georg Gunther, Bert L. Hartnell, Douglas F. Rall:
Star-factors and k-bounded total domination. 197-201 - Hung-Kuei Ku, John P. Hayes:
Optimally edge fault-tolerant trees. 203-214
Volume 27, Number 4, July 1996
- Prakash Mirchandani:
A simple O(n2) algorithm for the all-pairs shortest path problem on an interval graph. 215-217 - Emanuel Melachrinoudis, Mary E. Helander:
A single facility location problem on a tree with unreliable edges. 219-237 - Pierre Fraigniaud, Christian Laforest:
Minimum gossip bus networks. 239-251 - A. Volgenant:
An addendum to the most vital edges of matching in a bipartite graph. 253 - Chun-Nan Hung, Lih-Hsing Hsu, Ting-Yi Sung:
A response to Volgenant's Addendum on the most vital edges. 255
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-06-10 21:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
