Остановите войну!
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 30 matches
- 2023
- Trust Tawanda, Philimon Nyamugure, Elias Munapo, Santosh Kumar:
Extreme Min - Cut Max - Flow Algorithm. Int. J. Appl. Metaheuristic Comput. 14(1): 1-16 (2023) - Patrick M. Jensen, Niels Jeppesen, Anders B. Dahl, Vedrana Andersen Dahl:
Review of Serial and Parallel Min-Cut/Max-Flow Algorithms for Computer Vision. IEEE Trans. Pattern Anal. Mach. Intell. 45(2): 2310-2329 (2023) - 2022
- Nada Alzaben, Daniel W. Engels:
End-to-End Routing in SDN Controllers Using Max-Flow Min-Cut Route Selection Algorithm. ICACT 2022: 461-467 - Nada Alzaben, Daniel W. Engels:
End-to-End Routing Algorithm Based on Max-Flow Min-Cut in SDN Controllers. ICACT 2022: 1405-1413 - Patrick M. Jensen, Niels Jeppesen, Anders B. Dahl, Vedrana Andersen Dahl:
Review of Serial and Parallel Min-Cut/Max-Flow Algorithms for Computer Vision. CoRR abs/2202.00418 (2022) - 2021
- Nada Alzaben, Daniel W. Engels:
End-to-End Routing in SDN Controllers Using Max-Flow Min-Cut Route Selection Algorithm. ICACT 2021: 461-467 - 2020
- Lifan Zhou, Yang Lan, Yu Xia, Shengrong Gong:
Extended Phase Unwrapping Max-Flow/Min-Cut Algorithm for Multibaseline SAR Interferograms Using a Two-Stage Programming Approach. Sensors 20(2): 375 (2020) - 2017
- Varun Ramesh, Shivanee Nagarajan, Jason J. Jung, Saswati Mukherjee:
Max-flow min-cut algorithm with application to road networks. Concurr. Comput. Pract. Exp. 29(11) (2017) - 2016
- Kensuke Otsuki, Yusuke Kobayashi, Kazuo Murota:
Improved max-flow min-cut algorithms in a Circular Disk Failure Model with application to a road network. Eur. J. Oper. Res. 248(2): 396-403 (2016) - Varun Ramesh, Shivanee Nagarajan, Saswati Mukherjee:
Max-flow Min-cut Algorithm in Spark with Application to Road Networks. BDTA 2016: 12-22 - 2014
- Yusuke Kobayashi, Kensuke Otsuki:
Max-flow min-cut theorem and faster algorithms in a circular disk failure model. INFOCOM 2014: 1635-1643 - 2011
- S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari:
A Max-Flow/Min-Cut Algorithm for Linear Deterministic Relay Networks. IEEE Trans. Inf. Theory 57(5): 3005-3015 (2011) - Raquel Fandos, Leyna Sadamori, Abdelhak M. Zoubir:
High quality segmentation of synthetic aperture sonar images using the min-cut/max-flow algorithm. EUSIPCO 2011: 51-55 - Giuseppe F. Italiano, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen:
Improved algorithms for min cut and max flow in undirected planar graphs. STOC 2011: 313-322 - 2010
- Ali Ridha Mahjoub, S. Thomas McCormick:
Max Flow and Min Cut with bounded-length paths: complexity, algorithms, and approximation. Math. Program. 124(1-2): 271-284 (2010) - S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari:
A Max-Flow/Min-Cut Algorithm for a Class of Wireless Networks. SODA 2010: 1209-1226 - Barak Fishbain, Dorit S. Hochbaum, Stefan Müller:
Competitive Analysis of Minimum-Cut Maximum Flow Algorithms in Vision Problems. CoRR abs/1007.4531 (2010) - 2008
- Yun Zeng, Dimitris Samaras, Wei Chen, Qunsheng Peng:
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images. Comput. Vis. Image Underst. 112(1): 81-90 (2008) - 2006
- Timothy Gatzke, Cindy Grimm:
Feature Detection Using Curvature Maps and the Min-cut/Max-flow Algorithm. GMP 2006: 578-584 - 2004
- Yuri Boykov, Vladimir Kolmogorov:
An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision. IEEE Trans. Pattern Anal. Mach. Intell. 26(9): 1124-1137 (2004) - 2002
- Matthew S. Levine:
Algorithms for connectivity problems in undirected graphs: maximum flow and minimun [kappa]-way cut. Massachusetts Institute of Technology, Cambridge, MA, USA, 2002 - 2001
- Dorit S. Hochbaum:
A new - old algorithm for minimum-cut and maximum-flow in closure graphs. Networks 37(4): 171-193 (2001) - Yuri Boykov, Vladimir Kolmogorov:
An Experimental Comparison of Min-cut/Max-flow Algorithms for Energy Minimization in Vision. EMMCVPR 2001: 359-374 - 1999
- Frank Thomson Leighton, Satish Rao:
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM 46(6): 787-832 (1999) - 1998
- Yonatan Aumann, Yuval Rabani:
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm. SIAM J. Comput. 27(1): 291-301 (1998) - 1992
- Chung-Kuan Cheng, T. C. Hu:
Maximum Concurrent Flows and Minimum Cuts. Algorithmica 8(3): 233-249 (1992) - 1988
- Frank Thomson Leighton, Satish Rao:
An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms. FOCS 1988: 422-431 - 1987
- Donald B. Johnson:
Parallel algorithms for minimum cuts and maximum flows in planar networks. J. ACM 34(4): 950-967 (1987) - Klaus Truemper:
Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes. Math. Oper. Res. 12(1): 72-96 (1987) - 1982
- Donald B. Johnson, Shankar M. Venkatesan:
Parallel Algorithms for Minimum Cuts and Maximum Flows in Planar Networks (Preliminary Version). FOCS 1982: 244-254
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-08-05 13:41 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