default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 17
Volume 17, Number 1, 1987
- Arie Segev:
The node-weighted steiner tree problem. 1-17 - T. C. Hu, Yue-Sun Kuo:
Graph folding and programmable logic array. 19-37 - A. Nakayama, Bernard Péroche:
Linear arboricity of digraphs. 39-53 - Peter J. Slater:
Domination and location in acyclic graphs. 55-64 - Anantaram Balakrishnan, Nitin R. Patel:
Problem reduction methods and a tree generation algorithm for the steiner network problem. 65-85 - Stein W. Wallace:
Investing in arcs in a network to maximize the expected max flow. 87-103 - Donald K. Wagner:
Forbidden subgraphs and graph decomposition. 105-110
Volume 17, Number 2, 1987
- R. K. Ahuja, V. V. S. Murty:
New lower planes for the network design problem. 113-127 - Pawel Winter:
Steiner problem in networks: A survey. 129-167 - George S. Fishman:
A monte carlo sampling plan for estimating reliability parameters and related functions. 169-186 - Gian Carlo Bongiovanni, Daniel P. Bovet:
Minimal deadlock-free store-and-forward communication networks. 187-200 - Min-You Wu, Shu-Park Chan:
On the properties of directed switching networks. 201-226 - John A. Buzacott:
Node partition formula for directed graph reliability. 227-240 - Georg Gunther, Bert L. Hartnell, Richard J. Nowakowski
:
Neighbor-connected graphs and projective planes. 241-247
Volume 17, Number 3, 1987
- José Pinto Paixão, I. M. Branco:
A quasi-assignment algorithm for bus scheduling. 249-269 - Alan A. Bertossi, Paolo Carraresi, Giorgio Gallo:
On some matching problems arising in vehicle scheduling models. 271-281 - Moshe Dror, Helman Stern, Pierre Trudeau:
Postman tour on a graph with precedence relation on arcs. 283-294 - Yehoshua Perl:
Digraphs with maximum number of paths and cycles. 295-305 - Jayaram Bhasker, Sartaj Sahni:
A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph. 307-317 - Michael Florian, Jacques Guélat, Heinz Spiess:
An efficient implementation of the "partan" variant of the linear approximation method for the network equilibrium problem. 319-339 - Christopher C. Skiscim, Bruce L. Golden:
Computing k-shortest path lengths in euclidean networks. 341-352 - C. W. Duin, A. Volgenant:
Some generalizations of the steiner problem in graphs. 353-364
Volume 17, Number 4, 1987
- Michele Conforti, Gérard Cornuéjols:
An algorithmic framework for the matching problem in some hypergraphs. 365-386 - Vijaya Ramachandran:
The complexity of minimum cut and maximum flow problems in an acyclic network. 387-392 - Hyeong-Ah Choi, S. Louis Hakimi:
Data transfers in networks with transceivers. 393-421 - William R. Stewart Jr.:
Accelerated branch exchange heuristics for symmetric traveling salesman problems. 423-437 - Chung-Kuan Cheng:
Linear placement algorithms and applications to VLSI design. 439-464 - Fanica Gavril:
Algorithms for maximum k-colorings and k-coverings of transitive graphs. 465-470
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 2026-05-20 23:13 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:
