default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 33
Volume 33, Number 1, January 1999
- Christian Fremuth-Paeger, Dieter Jungnickel:
Balanced network flows. I. A unifying framework for design and analysis of matching algorithms. 1-28 - Christian Fremuth-Paeger, Dieter Jungnickel:
Balanced network flows. II. Simple augmentation algorithms. 29-41 - Christian Fremuth-Paeger, Dieter Jungnickel:
Balanced network flows. III. Strongly polynomial augmentation algorithms. 43-56 - Rainer E. Burkard, Karin Feldbacher, Bettina Klinz
, Gerhard J. Woeginger:
Minimum-cost strong network orientation problems: Classification, complexity, and algorithms. 57-70 - Akira Matsubayashi, Shuichi Ueno:
Small congestion embedding of graphs into hypercubes. 71-77
Volume 33, Number 2, March 1999
- Horst W. Hamacher, Martine Labbé, Stefan Nickel:
Multicriteria network location problems with sum objectives. 79-92 - Anna Nagurney, Stavros Siokos:
Dynamic multi-sector, multi-instrument financial networks with futures: Modeling and computation. 93-108 - Ishwar Murthy, Phil K. Seo:
A dual-ascent procedure for the file allocation and join site selection problem on a telecommunications network. 109-124 - Martin Zachariasen:
Rectilinear full Steiner tree generation. 125-143 - Marcus Brazil, Doreen A. Thomas, Jia F. Weng:
A polynomial time algorithm for rectilinear Steiner trees with terminals constrained to curves. 145-155 - Qiaoliang Li, Qiao Li:
Super edge connectivity properties of connected edge symmetric graphs. 157-159
Volume 33, Number 3, May 1999
- Weizhen Gu:
On diameter of permutation graphs. 161-166 - Dimitrios Kagaris, Grammati E. Pantziou, Spyros Tragoudas, Christos D. Zaroliagis:
Transmissions in a network with capacities and delays. 167-174 - Dan Trietsch, J. F. Weng:
Pseudo-Gilbert-Steiner trees. 175-178 - Bruno Beauquier:
All-to-all communication for some wavelength-routed all-optical networks. 179-187 - Bettina Klinz, Gerhard J. Woeginger:
A note on the bottleneck graph partition problem. 189-191 - Enrique F. Castillo, Ali S. Hadi, Francisco Jubete, Cristina Solares:
An expert system for coherent assessment of probabilities in multigraph models. 193-206 - Cécile Murat, Vangelis Th. Paschos:
The probabilistic longest path problem. 207-219 - Yu-Chee Tseng, Yuh-Shyan Chen, Tong-Ying Juang, Chiou-Jyu Chang:
Congestion-free, dilation-2 embedding of complete binary trees into star graphs. 221-231 - Hajo Broersma, Erik Engbers, Huib Trommel:
Various results on the toughness of graphs. 233-238 - Ashish Tripathy, Haldun Süral, Yigal Gerchak:
Multidimensional assortment problem with an application. 239-245
Volume 33, Number 4, July 1999
- Nicholas Pippenger:
Upper and lower bounds for the average-case complexity of path-search. 249-259 - Gerard J. Chang, Frank K. Hwang, Li-Da Tong:
Characterizing bit permutation networks. 261-267 - Gaylord W. Richards, Frank K. Hwang:
Extended generalized shuffle networks: Ssufficient conditions for strictly nonblocking operation. 269-291 - Yi Du, Gerald M. Masson:
Strictly nonblocking conference networks using high-dimensional meshes. 293-308
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 2025-12-02 23:29 CET 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:
