Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 25
Volume 25, Number 1, January 1995
- Jerzy Topp
:
Sequences of graphical invariants. 1-5 - Barry L. Piazza, Fred S. Roberts, Sam Stueckle:
Edge-tenacious networks. 7-17 - Ehab S. Elmallah, Joseph C. Culberson:
Multicommodity flows in simple multistage networks. 19-30 - Marion Rodrigues, Hasan Ural:
Lower bounds for the length of test sequences using UIOs. 31-39
Volume 25, Number 2, March 1995
- Jason Fulman, Denis Hanson, Gary MacGillivray:
Vertex domination-critical graphs. 41-43 - Igor Averbakh, Oded Berman:
Sales-delivery man problems on treelike networks. 45-58 - Madhav V. Marathe, H. Breu, Harry B. Hunt III, S. S. Ravi, Daniel J. Rosenkrantz:
Simple heuristics for unit disk graphs. 59-68 - Jeffrey S. Salowe, David M. Warme:
Thirty-five-point rectilinear steiner minimal trees in a day. 69-87 - Ravindra K. Ahuja, James B. Orlin:
A capacity scaling algorithm for the constrained maximum flow problem. 89-98
Volume 25, Number 3, May 1995
- Charles J. Colbourn, Klaus Sutner:
Preface. 99 - Michael O. Ball, Jane N. Hagstrom, J. Scott Provan:
Threshold reliability of networks with small failure sets. 101-115 - Adam L. Buchsbaum, Milena Mihail:
Monte Carlo and Markov Chain techniques for network reliability and sampling. 117-130 - Jsen-Shung Lin, Chin-Chia Jane, John Yuan:
On reliability evaluation of a capacitated-flow network in terms of minimal pathsets. 131-138 - Gerard T. Lingner, Themistocles Politof, Appajosyula Satyanarayana:
A forbidden minor characterization and reliability of a class of partial 4-trees. 139-146 - Suresh Rai, Malathi Veeraraghavan, Kishor S. Trivedi:
A survey of efficient reliability computation using disjoint products approach. 147-163 - Heidi J. Strayer, Charles J. Colbourn:
Consecutive cuts and paths, and bounds on k-terminal reliability. 165-175
Volume 25, Number 4, July 1995
- Michael Florian, S. J. Thomas, R. V. M. Zahar:
On truncated-newton methods for solving the spatial price equilibrium problem. 177-182 - Gopalakrishnan Sundaram, Steven Skiena:
Recognizing small subgraphs. 183-191 - Guoli Ding:
Graphs with not too many spanning trees. 193-197 - Egon Balas:
The prize collecting traveling salesman problem: II. Polyhedral results. 199-216
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-04-19 19:19 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:
