default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 30
Volume 30, Number 1, August 1997
- Khee Meng Koh, Eng Guan Tay:
On optimal orientations of Cartesian products of even cycles and paths. 1-7 - Christos Alexopoulos:
State space partitioning methods for stochastic shortest path problems. 9-21 - Bryan Gilbert, Wendy J. Myrvold:
Maximizing spanning trees in almost complete graphs. 23-30 - S. Louis Hakimi, Edward F. Schmeichel:
Locating replicas of a database on a network. 31-36 - Guoliang Xue:
Linear time algorithms for computing the most reliable source on an unreliable tree network. 37-45 - Zbigniew Lonc, Krzysztof Parol, Jacek Wojciechowski:
On the asymptotic behavior of the maximum number of spanning trees in circulant graphs. 47-56 - Peh H. Ng, Ronald L. Rardin:
Commodity family extended formulations of uncapacitated fixed charge network flow problems. 57-71 - Kathryn Fraughnaugh:
Introduction to graph theory. 73
Volume 30, Number 2, September 1997
- Gerard J. Chang, Frank K. Hwang:
Optimality of consecutive and nested tree partitions. 75-80 - Frank K. Hwang, Paul E. Wright, Xiao-Dong Hu:
Exact reliabilities of most reliable double-loop networks. 81-90 - Gengui Zhou, Mitsuo Gen:
A note on genetic algorithms for degree-constrained spanning tree problems. 91-95 - Bryan Gilbert, Wendy J. Myrvold:
Maximizing spanning trees in almost complete graphs. 97-104 - Jean-François Cordeau, Michel Gendreau, Gilbert Laporte:
A tabu search heuristic for periodic and multi-depot vehicle routing problems. 105-119 - Feodor F. Dragan, Falk Nicolai:
r-domination problems on homogeneously orderable graphs. 121-131 - Bo Yu, Joseph Cheriyan:
The node multiterminal cut polyhedron. 133-148
Volume 30, Number 3, October 1997
- Pawel Winter, Martin Zachariasen:
Euclidean Steiner minimum trees: An improved exact algorithm. 149-166 - Peter Che Bor Lam, Zhongfu Zhang:
The vertex-face total chromatic number of Halin graphs. 167-170 - Russ J. Vander Wiel, Nikolaos V. Sahinidis:
The assignment problem with external interactions. 171-185 - Jean-Claude Bermond, Zhen Liu, Michel Syska:
Mean eccentricities of de Bruijn networks. 187-203 - Jean-Claude Bermond, Robin W. Dawes, Fahir Ö. Ergincan:
De Bruijn and Kautz bus networks. 205-218 - Dyi-Rong Duh, Gen-Huey Chen:
On the Rabin number problem. 219-230
Volume 30, Number 4, December 1997
- Guifang Wang, Lianzhu Zhang:
The structure of max lambda-min m+1 graphs used in the design of reliable networks. 231-242 - David P. Day, Ortrud Oellermann, Henda C. Swart:
A characterization of 3-Steiner distance hereditary graphs. 243-253 - Serge Lawrencenko, Qiang Luo:
Graphs with given connectivity properties. 255-261 - Yves Crama, Maarten Oosten:
The polytope of block diagonal matrices and complete bipartite partitionings. 263-282 - Sang Kyu Lee, Hyeong-Ah Choi:
Link-disjoint embedding of complete binary trees in meshes. 283-292 - José Rodríguez, Lorenzo Traldi:
(K, j)-domination and (K, j)-reliability. 293-306
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-10-02 20:44 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:
