![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 44 matches
- 1984
- John E. Beasley
:
An algorithm for the steiner problem in graphs. Networks 14(1): 147-159 (1984) - Francis T. Boesch:
Reviews in graph theory, edited by William G. Brown, American Mathematical Society, 1980. Volumes I, II, III, IV (paperback). Networks 14(1): 173 (1984) - Louis Caccetta:
Vulnerability of communication networks. Networks 14(1): 141-146 (1984) - Malachy Carey
, Chris Hendrickson:
Bounds on expected performance of networks with links subject to failure. Networks 14(3): 439-456 (1984) - Grant A. Cheston:
On-line connectivity algorithms. Networks 14(1): 83-94 (1984) - Nicos Christofides, John E. Beasley
:
The period routing problem. Networks 14(2): 237-256 (1984) - Narsingh Deo, Chi-Yin Pang:
Shortest-path algorithms: Taxonomy and annotation. Networks 14(2): 275-323 (1984) - Jacques Desrosiers, François Soumis, Martin Desrochers:
Routing with time windows by column generation. Networks 14(4): 545-565 (1984) - Abdol-Hossein Esfahanian, S. Louis Hakimi:
On computing the connectivities of graphs and digraphs. Networks 14(2): 355-366 (1984) - Shimon Even, Oded Goldreich
, Shlomo Moran, Po Tong:
On the np-completeness of certain network testing problems. Networks 14(1): 1-24 (1984) - Alberto Garcia-Diaz, Donald K. Friesen, Donald J. Bagert:
Sorting algorithms for the implementation of a generalized vector product. Networks 14(2): 269-273 (1984) - Pedro G. Gazmuri:
Independent sets in random sparse graphs. Networks 14(3): 367-377 (1984) - Fred W. Glover, Randy Glover, Darwin Klingman:
Computational study of an improved shortest path algorithm. Networks 14(1): 25-36 (1984) - Noel P. Greis:
Introduction to mathematical programming: Quantitative tools for decision-making, by Benjamin Lev and Howard J. Weiss, North-Holland, New York, 1982, 287 pp. Price: $39.50. Networks 14(1): 178-179 (1984) - Jane N. Hagstrom:
Note on independence of arcs in antiparallel for network flow problems. Networks 14(4): 567-570 (1984) - Bruce E. Hajek, Richard G. Ogier:
Optimal dynamic routing in communication networks with continuous traffic. Networks 14(3): 457-487 (1984) - Refael Hassin:
On multicommodity flows in planar graphs. Networks 14(2): 225-235 (1984) - Qi-Mei He:
An extremal problem on the connectivity of graphs. Networks 14(2): 337-354 (1984) - Yoshi Ikura:
Network optimization practice: A Computational Guide, by D. K. Smith, John Wiley, New York, 1982, 237 pp. Price: $59.95. Networks 14(4): 597-598 (1984) - A. Itai, D. K. Pradhan:
Synthesis of directed multicommodity flow networks. Networks 14(2): 213-224 (1984) - Jeffrey M. Jaffe:
Algorithms for finding paths with multiple constraints. Networks 14(1): 95-116 (1984) - Marjory J. Johnson:
Updating routing tables after resource failure in a distributed computer network. Networks 14(3): 379-391 (1984) - R. Johnson:
Network reliability and acyclic orientations. Networks 14(4): 489-505 (1984) - Andrea S. LaPaugh, Christos H. Papadimitriou:
The even-path problem for graphs and digraphs. Networks 14(4): 507-513 (1984) - Gilbert Laporte, Martin Desrochers, Yves Nobert:
Two exact algorithms for the distance-constrained vehicle routing problem. Networks 14(1): 161-172 (1984) - D. T. Lee, Franco P. Preparata:
Euclidean shortest paths in the presence of rectilinear barriers. Networks 14(3): 393-410 (1984) - Chen-Ching Liu, Felix F. Wu:
a generalized network flow model with application to power supply-demand problems. Networks 14(1): 117-139 (1984) - John A. Mallick:
Bond graphs for modeling engineering systems, by A. J. Blundell, Halstead, Ellis Horwood Limited, London, 1982, 151 pp. Price: $44.95. Networks 14(1): 176-177 (1984) - Edward Minieka:
Graph theory and applications, by H. Neville V. Temperley, Halsted Press, New York, 1981, 130 pp. Price: $44.95. Networks 14(4): 597 (1984) - Azuma Ohuchi, Ikuo Kaji:
Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costs. Networks 14(4): 515-530 (1984)
skipping 14 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-08-23 21:48 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint