Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "min-cut max-flow algorithm"
download as .bib file
@article{DBLP:journals/ijamc-igi/TawandaNMK23,
author = {Trust Tawanda and
Philimon Nyamugure and
Elias Munapo and
Santosh Kumar},
title = {Extreme Min - Cut Max - Flow Algorithm},
journal = {Int. J. Appl. Metaheuristic Comput.},
volume = {14},
number = {1},
pages = {1--16},
year = {2023},
url = {https://doi.org/10.4018/ijamc.322436},
doi = {10.4018/IJAMC.322436},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijamc-igi/TawandaNMK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pami/JensenJDD23,
author = {Patrick M. Jensen and
Niels Jeppesen and
Anders B. Dahl and
Vedrana Andersen Dahl},
title = {Review of Serial and Parallel Min-Cut/Max-Flow Algorithms for Computer
Vision},
journal = {{IEEE} Trans. Pattern Anal. Mach. Intell.},
volume = {45},
number = {2},
pages = {2310--2329},
year = {2023},
url = {https://doi.org/10.1109/TPAMI.2022.3170096},
doi = {10.1109/TPAMI.2022.3170096},
timestamp = {Thu, 27 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pami/JensenJDD23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icact/AlzabenE22,
author = {Nada Alzaben and
Daniel W. Engels},
title = {End-to-End Routing in {SDN} Controllers Using Max-Flow Min-Cut Route
Selection Algorithm},
booktitle = {24th International Conference on Advanced Communication Technology,
{ICACT} 2022, Pyeongchang, Korea, February 13-16, 2022},
pages = {461--467},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.23919/ICACT53585.2022.9728920},
doi = {10.23919/ICACT53585.2022.9728920},
timestamp = {Fri, 18 Mar 2022 11:45:43 +0100},
biburl = {https://dblp.org/rec/conf/icact/AlzabenE22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icact/AlzabenE22a,
author = {Nada Alzaben and
Daniel W. Engels},
title = {End-to-End Routing Algorithm Based on Max-Flow Min-Cut in {SDN} Controllers},
booktitle = {24th International Conference on Advanced Communication Technology,
{ICACT} 2022, Pyeongchang, Korea, February 13-16, 2022},
pages = {1405--1413},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.23919/ICACT53585.2022.9728780},
doi = {10.23919/ICACT53585.2022.9728780},
timestamp = {Fri, 18 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icact/AlzabenE22a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-00418,
author = {Patrick M. Jensen and
Niels Jeppesen and
Anders B. Dahl and
Vedrana Andersen Dahl},
title = {Review of Serial and Parallel Min-Cut/Max-Flow Algorithms for Computer
Vision},
journal = {CoRR},
volume = {abs/2202.00418},
year = {2022},
url = {https://arxiv.org/abs/2202.00418},
eprinttype = {arXiv},
eprint = {2202.00418},
timestamp = {Wed, 09 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-00418.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icact/AlzabenE21,
author = {Nada Alzaben and
Daniel W. Engels},
title = {End-to-End Routing in {SDN} Controllers Using Max-Flow Min-Cut Route
Selection Algorithm},
booktitle = {23rd International Conference on Advanced Communication Technology,
{ICACT} 2021, Pyeongchang, South Korea, February 7-10, 2021},
pages = {461--467},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.23919/ICACT51234.2021.9371006},
doi = {10.23919/ICACT51234.2021.9371006},
timestamp = {Fri, 18 Mar 2022 11:48:11 +0100},
biburl = {https://dblp.org/rec/conf/icact/AlzabenE21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sensors/ZhouLXG20,
author = {Lifan Zhou and
Yang Lan and
Yu Xia and
Shengrong Gong},
title = {Extended Phase Unwrapping Max-Flow/Min-Cut Algorithm for Multibaseline
{SAR} Interferograms Using a Two-Stage Programming Approach},
journal = {Sensors},
volume = {20},
number = {2},
pages = {375},
year = {2020},
url = {https://doi.org/10.3390/s20020375},
doi = {10.3390/S20020375},
timestamp = {Sat, 30 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sensors/ZhouLXG20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/concurrency/RameshNJM17,
author = {Varun Ramesh and
Shivanee Nagarajan and
Jason J. Jung and
Saswati Mukherjee},
title = {Max-flow min-cut algorithm with application to road networks},
journal = {Concurr. Comput. Pract. Exp.},
volume = {29},
number = {11},
year = {2017},
url = {https://doi.org/10.1002/cpe.4099},
doi = {10.1002/CPE.4099},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/concurrency/RameshNJM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/Otsuki0M16,
author = {Kensuke Otsuki and
Yusuke Kobayashi and
Kazuo Murota},
title = {Improved max-flow min-cut algorithms in a Circular Disk Failure Model
with application to a road network},
journal = {Eur. J. Oper. Res.},
volume = {248},
number = {2},
pages = {396--403},
year = {2016},
url = {https://doi.org/10.1016/j.ejor.2015.07.035},
doi = {10.1016/J.EJOR.2015.07.035},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/Otsuki0M16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/bdta/RameshNM16,
author = {Varun Ramesh and
Shivanee Nagarajan and
Saswati Mukherjee},
editor = {Jason J. Jung and
Pankoo Kim},
title = {Max-flow Min-cut Algorithm in Spark with Application to Road Networks},
booktitle = {Big Data Technologies and Applications - 7th International Conference,
{BDTA} 2016, Seoul, South Korea, November 17-18, 2016, Proceedings},
series = {Lecture Notes of the Institute for Computer Sciences, Social Informatics
and Telecommunications Engineering},
volume = {194},
pages = {12--22},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-58967-1\_2},
doi = {10.1007/978-3-319-58967-1\_2},
timestamp = {Mon, 13 May 2019 12:58:05 +0200},
biburl = {https://dblp.org/rec/conf/bdta/RameshNM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infocom/KobayashiO14,
author = {Yusuke Kobayashi and
Kensuke Otsuki},
title = {Max-flow min-cut theorem and faster algorithms in a circular disk
failure model},
booktitle = {2014 {IEEE} Conference on Computer Communications, {INFOCOM} 2014,
Toronto, Canada, April 27 - May 2, 2014},
pages = {1635--1643},
publisher = {{IEEE}},
year = {2014},
url = {https://doi.org/10.1109/INFOCOM.2014.6848100},
doi = {10.1109/INFOCOM.2014.6848100},
timestamp = {Wed, 16 Oct 2019 14:14:51 +0200},
biburl = {https://dblp.org/rec/conf/infocom/KobayashiO14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/YazdiS11,
author = {S. M. Sadegh Tabatabaei Yazdi and
Serap A. Savari},
title = {A Max-Flow/Min-Cut Algorithm for Linear Deterministic Relay Networks},
journal = {{IEEE} Trans. Inf. Theory},
volume = {57},
number = {5},
pages = {3005--3015},
year = {2011},
url = {https://doi.org/10.1109/TIT.2011.2120250},
doi = {10.1109/TIT.2011.2120250},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/YazdiS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eusipco/FandosSZ11,
author = {Raquel Fandos and
Leyna Sadamori and
Abdelhak M. Zoubir},
title = {High quality segmentation of synthetic aperture sonar images using
the min-cut/max-flow algorithm},
booktitle = {Proceedings of the 19th European Signal Processing Conference, {EUSIPCO}
2011, Barcelona, Spain, August 29 - Sept. 2, 2011},
pages = {51--55},
publisher = {{IEEE}},
year = {2011},
url = {https://ieeexplore.ieee.org/document/7074298/},
timestamp = {Mon, 09 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/eusipco/FandosSZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ItalianoNSW11,
author = {Giuseppe F. Italiano and
Yahav Nussbaum and
Piotr Sankowski and
Christian Wulff{-}Nilsen},
editor = {Lance Fortnow and
Salil P. Vadhan},
title = {Improved algorithms for min cut and max flow in undirected planar
graphs},
booktitle = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing, {STOC}
2011, San Jose, CA, USA, 6-8 June 2011},
pages = {313--322},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/1993636.1993679},
doi = {10.1145/1993636.1993679},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ItalianoNSW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/MahjoubM10,
author = {Ali Ridha Mahjoub and
S. Thomas McCormick},
title = {Max Flow and Min Cut with bounded-length paths: complexity, algorithms,
and approximation},
journal = {Math. Program.},
volume = {124},
number = {1-2},
pages = {271--284},
year = {2010},
url = {https://doi.org/10.1007/s10107-010-0366-6},
doi = {10.1007/S10107-010-0366-6},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/MahjoubM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/YazdiS10,
author = {S. M. Sadegh Tabatabaei Yazdi and
Serap A. Savari},
editor = {Moses Charikar},
title = {A Max-Flow/Min-Cut Algorithm for a Class of Wireless Networks},
booktitle = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010},
pages = {1209--1226},
publisher = {{SIAM}},
year = {2010},
url = {https://doi.org/10.1137/1.9781611973075.97},
doi = {10.1137/1.9781611973075.97},
timestamp = {Tue, 02 Feb 2021 17:07:39 +0100},
biburl = {https://dblp.org/rec/conf/soda/YazdiS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1007-4531,
author = {Barak Fishbain and
Dorit S. Hochbaum and
Stefan M{\"{u}}ller},
title = {Competitive Analysis of Minimum-Cut Maximum Flow Algorithms in Vision
Problems},
journal = {CoRR},
volume = {abs/1007.4531},
year = {2010},
url = {http://arxiv.org/abs/1007.4531},
eprinttype = {arXiv},
eprint = {1007.4531},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1007-4531.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cviu/ZengSCP08,
author = {Yun Zeng and
Dimitris Samaras and
Wei Chen and
Qunsheng Peng},
title = {Topology cuts: {A} novel min-cut/max-flow algorithm for topology preserving
segmentation in {N-D} images},
journal = {Comput. Vis. Image Underst.},
volume = {112},
number = {1},
pages = {81--90},
year = {2008},
url = {https://doi.org/10.1016/j.cviu.2008.07.008},
doi = {10.1016/J.CVIU.2008.07.008},
timestamp = {Fri, 26 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cviu/ZengSCP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gmp/GatzkeG06,
author = {Timothy Gatzke and
Cindy Grimm},
editor = {Myung{-}Soo Kim and
Kenji Shimada},
title = {Feature Detection Using Curvature Maps and the Min-cut/Max-flow Algorithm},
booktitle = {Geometric Modeling and Processing - {GMP} 2006, 4th International
Conference, Pittsburgh, PA, USA, July 26-28, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4077},
pages = {578--584},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11802914\_43},
doi = {10.1007/11802914\_43},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gmp/GatzkeG06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pami/BoykovK04,
author = {Yuri Boykov and
Vladimir Kolmogorov},
title = {An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy
Minimization in Vision},
journal = {{IEEE} Trans. Pattern Anal. Mach. Intell.},
volume = {26},
number = {9},
pages = {1124--1137},
year = {2004},
url = {https://doi.org/10.1109/TPAMI.2004.60},
doi = {10.1109/TPAMI.2004.60},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pami/BoykovK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/ndltd/Levine02,
author = {Matthew S. Levine},
title = {Algorithms for connectivity problems in undirected graphs: maximum
flow and minimun [kappa]-way cut},
school = {Massachusetts Institute of Technology, Cambridge, MA, {USA}},
year = {2002},
url = {https://hdl.handle.net/1721.1/29234},
timestamp = {Wed, 04 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/ndltd/Levine02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Hochbaum01,
author = {Dorit S. Hochbaum},
title = {A new - old algorithm for minimum-cut and maximum-flow in closure
graphs},
journal = {Networks},
volume = {37},
number = {4},
pages = {171--193},
year = {2001},
url = {https://doi.org/10.1002/net.1012},
doi = {10.1002/NET.1012},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Hochbaum01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/emmcvpr/BoykovK01,
author = {Yuri Boykov and
Vladimir Kolmogorov},
editor = {M{\'{a}}rio A. T. Figueiredo and
Josiane Zerubia and
Anil K. Jain},
title = {An Experimental Comparison of Min-cut/Max-flow Algorithms for Energy
Minimization in Vision},
booktitle = {Energy Minimization Methods in Computer Vision and Pattern Recognition,
Third International Workshop, {EMMCVPR} 2001, Sophia Antipolis, France,
September 3-5, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2134},
pages = {359--374},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44745-8\_24},
doi = {10.1007/3-540-44745-8\_24},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/emmcvpr/BoykovK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LeightonR99,
author = {Frank Thomson Leighton and
Satish Rao},
title = {Multicommodity max-flow min-cut theorems and their use in designing
approximation algorithms},
journal = {J. {ACM}},
volume = {46},
number = {6},
pages = {787--832},
year = {1999},
url = {https://doi.org/10.1145/331524.331526},
doi = {10.1145/331524.331526},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/LeightonR99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AumannR98,
author = {Yonatan Aumann and
Yuval Rabani},
title = {An \emph{O}(log \emph{k}) Approximate Min-Cut Max-Flow Theorem and
Approximation Algorithm},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {1},
pages = {291--301},
year = {1998},
url = {https://doi.org/10.1137/S0097539794285983},
doi = {10.1137/S0097539794285983},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AumannR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChengH92,
author = {Chung{-}Kuan Cheng and
T. C. Hu},
title = {Maximum Concurrent Flows and Minimum Cuts},
journal = {Algorithmica},
volume = {8},
number = {3},
pages = {233--249},
year = {1992},
url = {https://doi.org/10.1007/BF01758845},
doi = {10.1007/BF01758845},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChengH92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LeightonR88,
author = {Frank Thomson Leighton and
Satish Rao},
title = {An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity
Flow Problems with Applications to Approximation Algorithms},
booktitle = {29th Annual Symposium on Foundations of Computer Science, White Plains,
New York, USA, 24-26 October 1988},
pages = {422--431},
publisher = {{IEEE} Computer Society},
year = {1988},
url = {https://doi.org/10.1109/SFCS.1988.21958},
doi = {10.1109/SFCS.1988.21958},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LeightonR88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Johnson87,
author = {Donald B. Johnson},
title = {Parallel algorithms for minimum cuts and maximum flows in planar networks},
journal = {J. {ACM}},
volume = {34},
number = {4},
pages = {950--967},
year = {1987},
url = {https://doi.org/10.1145/31846.31849},
doi = {10.1145/31846.31849},
timestamp = {Tue, 18 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Johnson87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/Truemper87,
author = {Klaus Truemper},
title = {Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms
for Maximum Flow and Shortest Routes},
journal = {Math. Oper. Res.},
volume = {12},
number = {1},
pages = {72--96},
year = {1987},
url = {https://doi.org/10.1287/moor.12.1.72},
doi = {10.1287/MOOR.12.1.72},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/Truemper87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/JohnsonV82,
author = {Donald B. Johnson and
Shankar M. Venkatesan},
title = {Parallel Algorithms for Minimum Cuts and Maximum Flows in Planar Networks
(Preliminary Version)},
booktitle = {23rd Annual Symposium on Foundations of Computer Science, Chicago,
Illinois, USA, 3-5 November 1982},
pages = {244--254},
publisher = {{IEEE} Computer Society},
year = {1982},
url = {https://doi.org/10.1109/SFCS.1982.83},
doi = {10.1109/SFCS.1982.83},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/JohnsonV82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
retrieved on 2024-05-27 12:34 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
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:
