Остановите войну!
for scientists:
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 27 matches
- 1993
- David S. Johnson, Catherine C. McGeoch:
Network Flows And Matching, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 14-16, 1991. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 12, DIMACS/AMS 1993, ISBN 978-0-8218-6598-9 [contents] - 1991
- Farid Alizadeth, Andrew V. Goldberg:
Implementing the Push-Relabel Method for the Maximum Flow Problem on a Connection Machine. Network Flows And Matching 1991: 65-95 - Richard J. Anderson, João Carlos Setubal:
Goldberg's Algorithm for Maximum Flow in Perspective: A Computational Study. Network Flows And Matching 1991: 1-18 - David L. Applegate, William J. Cook:
Solving Large-Scale Matching Problems. Network Flows And Matching 1991: 557-576 - Tamás Badics, Endre Boros:
Implementing a Maximum Flow Algorithm: Experiments with Dynamic Trees. Network Flows And Matching 1991: 43-63 - Robert G. Bland, Joseph Cheriyan, David L. Jensen, Laszlo Ladányi:
An Empirical Study of Min Cost Flow Algorithms for the Minimum-Cost Flow Problem. Network Flows And Matching 1991: 119-156 - James M. Borger, Sarah Kang, Philip N. Klein:
Approximating Concurrent Flow with Unit Demands and Capacities: An Implementation. Network Flows And Matching 1991: 371-386 - Martin Lee Brady, Kenneth K. Jung, H. T. Nguyen, Raghu Raghavan, Ramesh Subramonian:
The Assignment Problem on Parallel Architectures. Network Flows And Matching 1991: 469-517 - David A. Castañón:
Reverse Auction Algorithms for Assignment Problems. Network Flows And Matching 1991: 407-429 - Steven T. Crocker:
An Experimental Comparison of Two Maximum Cardinality Matching Programs. Network Flows And Matching 1991: 519-537 - Satoru Fujishige, Kazuo Iwano, J. Nakano, Shu Tezuka:
A Speculative Contraction Method for Minimum Cost Flows: Toward a Practical Algorithm. Network Flows And Matching 1991: 219-245 - Andrew V. Goldberg, Michael Kharitonov:
On Implementing Scaling Push-Relabel Algorithms for the Minimum-Cost Flow Problem. Network Flows And Matching 1991: 157-198 - Jack Jianxiu Hao, George Kocur:
An Implementation of a Shortest Augmenting Path Algorithm for the Assignment Problem. Network Flows And Matching 1991: 453-468 - David S. Johnson:
Appendix B: Panel Discussion Highlights. Network Flows And Matching 1991: 583-592 - David S. Johnson, Catherine C. McGeoch:
Preface. Network Flows And Matching 1991: xi- - Anil Joshi, Arthur S. Goldstein, Pravin M. Vaidya:
A Fast Implementation of a Path-Following Algorithm for Maximizing a Linear Function over a Network Polytope. Network Flows And Matching 1991: 267-298 - Tishya Leong, Peter W. Shor, Clifford Stein:
Implementation of a Combinatorial Multicommodity Flow Algorithm. Network Flows And Matching 1991: 387-405 - István Maros:
Performance Evaluation of the MINET Minimum Cost Netflow Solver. Network Flows And Matching 1991: 199-217 - R. Bruce Mattingly, Nathan P. Ritchey:
Implementing on O(/NM) Cardinality Matching Algorithm. Network Flows And Matching 1991: 539-556 - S. Thomas McCormick, Li Liu:
An Experimental Implementation of the Dual Cancel and Tighten Algorithm for Minimum-Cost Network Flow. Network Flows And Matching 1991: 247-266 - Catherine C. McGeoch:
Appendix A: Electronically Available Materials. Network Flows And Matching 1991: 577-582 - Søren S. Nielsen, Stavros A. Zenios:
On the Massively Parallel Solution of Linear Network Flow Problems. Network Flows And Matching 1991: 349-369 - Q. C. Nguyen, Venkat Venkateswaran:
Implementations of the Goldberg-Tarjan Maximum Flow Algorithm. Network Flows And Matching 1991: 19-41 - K. G. Ramakrishnan, Narendra Karmarkar, Anil P. Kamath:
An Approximate Dual Projective Algorithm for Solving Assignment Problems. Network Flows And Matching 1991: 431-451 - Mauricio G. C. Resende, Geraldo Veiga:
An Efficient Implementation of a Network Interior Point Method. Network Flows And Matching 1991: 299-348 - Gregory E. Shannon, John MacCuish, Elisabeth Johnson:
A Case Study in Algorithm Animation: Maximum Flow Algorithms. Network Flows And Matching 1991: 97-118 - Foreword. Network Flows And Matching 1991: ix-
loading more results
failed to load more results, please try again later
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-04-23 17:32 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