Results
Found 398 publication records. Showing 398 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
21 | Rajat Aggarwal, Rajeev Murgai, Masahiro Fujita |
Speeding up technology-independent timing optimization by network partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: Proceedings of the 1997 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1997, San Jose, CA, USA, November 9-13, 1997, pp. 83-90, 1997, IEEE Computer Society / ACM, 0-8186-8200-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
21 | Peter Ramyalal Suaris, Gershon Kedem |
A quadrisection-based combined place and route scheme for standard cells. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 8(3), pp. 234-244, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
21 | Lov K. Grover |
Standard Cell Placement Using Simulated Sintering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 24th ACM/IEEE Design Automation Conference. Miami Beach, FL, USA, June 28 - July 1, 1987., pp. 56-59, 1987, IEEE Computer Society Press / ACM. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
20 | Andrew Delong, Yuri Boykov |
A Scalable graph-cut algorithm for N-D grids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CVPR ![In: 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2008), 24-26 June 2008, Anchorage, Alaska, USA, 2008, IEEE Computer Society, 978-1-4244-2242-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Liza Fireman, Erez Petrank, Ayal Zaks |
New Algorithms for SIMD Alignment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CC ![In: Compiler Construction, 16th International Conference, CC 2007, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2007, Braga, Portugal, March 26-30, 2007, Proceedings, pp. 1-15, 2007, Springer, 978-3-540-71228-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
20 | Abraham Duarte, Ángel Sánchez 0001, Felipe Fernández, Antonio S. Montemayor, Juan José Pantrigo |
Top-Down Evolutionary Image Segmentation Using a Hierarchical Social Metaheuristic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EvoWorkshops ![In: Applications of Evolutionary Computing, EvoWorkshops 2004: EvoBIO, EvoCOMNET, EvoHOT, EvoIASP, EvoMUSART, and EvoSTOC, Coimbra, Portugal, April 5-7, 2004, Proceedings, pp. 301-311, 2004, Springer, 3-540-21378-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
20 | Navaratnasothie Selvakkumaran, Abhishek Ranjan, Salil Raje, George Karypis |
Multi-resource aware partitioning algorithms for FPGAs with heterogeneous resources. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 41th Design Automation Conference, DAC 2004, San Diego, CA, USA, June 7-11, 2004, pp. 741-746, 2004, ACM, 1-58113-828-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
multi-constraint, multi-resource, FPGA, partitioning, placement, hierarchical |
20 | Elliot Anshelevich, David Kempe 0001, Jon M. Kleinberg |
Stability of load balancing algorithms in dynamic adversarial systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada, pp. 399-406, 2002, ACM, 1-58113-495-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
20 | Daniel R. Brasen, Gabriele Saucier |
Using cone structures for circuit partitioning into FPGA packages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 17(7), pp. 592-600, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
20 | Lars W. Hagen, Andrew B. Kahng |
Combining problem reduction and adaptive multistart: a new technique for superior iterative partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 16(7), pp. 709-717, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
20 | G. Gayathri, Sunil Mathew, John N. Mordeson |
Max-flow min-cut theorem for directed fuzzy incidence networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Appl. Math. Comput. ![In: J. Appl. Math. Comput. 70(1), pp. 149-173, February 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
20 | Wenyu Jin 0001, Xiaorui Sun, Mikkel Thorup |
Fully Dynamic Min-Cut of Superconstant Size in Subpolynomial Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2401.09700, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
20 | Matthew Broussard, Bala Krishnamoorthy |
A tight max-flow min-cut duality theorem for nonlinear multicommodity flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 47(3), pp. 54, April 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
20 | Wenyu Jin 0001, Xiaorui Sun, Mikkel Thorup |
Fully Dynamic Min-Cut of Superconstant Size in Subpolynomial Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024, pp. 2999-3026, 2024, SIAM, 978-1-61197-791-2. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
20 | Patrick M. Jensen, Niels Jeppesen, Anders B. Dahl, Vedrana Andersen Dahl |
Review of Serial and Parallel Min-Cut/Max-Flow Algorithms for Computer Vision. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 45(2), pp. 2310-2329, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Trust Tawanda, Philimon Nyamugure, Elias Munapo, Santosh Kumar |
Extreme Min - Cut Max - Flow Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Appl. Metaheuristic Comput. ![In: Int. J. Appl. Metaheuristic Comput. 14(1), pp. 1-16, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Uéverton S. Souza |
A tight quasi-polynomial bound for Global Label Min-Cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 290-303, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Maxwell Allman, Venus Lo, S. Thomas McCormick |
Complexity of Source-Sink Monotone 2-parameter min cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 50(1), pp. 84-90, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Mohsen Ghaffari 0001, Goran Zuzic |
Universally-Optimal Distributed Exact Min-Cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2205.14967, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Uéverton S. Souza |
A tight quasi-polynomial bound for Global Label Min-Cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2207.07426, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Patrick M. Jensen, Niels Jeppesen, Anders B. Dahl, Vedrana Andersen Dahl |
Review of Serial and Parallel Min-Cut/Max-Flow Algorithms for Computer Vision. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2202.00418, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
20 | Andreas Lochbihler |
A Mechanized Proof of the Max-Flow Min-Cut Theorem for Countable Networks with Applications to Probability Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 66(4), pp. 585-610, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Sara Omranian, Zoran Nikoloski |
CUBCO+: prediction of protein complexes based on min-cut network partitioning into biclique spanned subgraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Netw. Sci. ![In: Appl. Netw. Sci. 7(1), pp. 71, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Nada Alzaben, Daniel W. Engels |
End-to-End Routing in SDN Controllers Using Max-Flow Min-Cut Route Selection Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICACT ![In: 24th International Conference on Advanced Communication Technology, ICACT 2022, Pyeongchang, Korea, February 13-16, 2022, pp. 461-467, 2022, IEEE, 979-11-88428-08-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Nada Alzaben, Daniel W. Engels |
End-to-End Routing Algorithm Based on Max-Flow Min-Cut in SDN Controllers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICACT ![In: 24th International Conference on Advanced Communication Technology, ICACT 2022, Pyeongchang, Korea, February 13-16, 2022, pp. 1405-1413, 2022, IEEE, 979-11-88428-08-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Mohsen Ghaffari 0001, Goran Zuzic |
Universally-Optimal Distributed Exact Min-Cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022, pp. 281-291, 2022, ACM, 978-1-4503-9262-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Jason Li 0006, Debmalya Panigrahi |
Deterministic Min-cut in Poly-logarithmic Max-flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2111.02008, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
20 | Nengkun Yu |
Quantum Max-Flow Min-Cut theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2110.00905, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
20 | Matthew Broussard, Bala Krishnamoorthy |
A Tight Max-Flow Min-Cut Duality Theorem for Non-Linear Multicommodity Flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2107.04252, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
20 | Maxwell Allman, Venus Lo, S. Thomas McCormick |
Complexity of Source-Sink Monotone 2-Parameter Min Cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2107.09743, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
20 | Ahmad Abdi, Gérard Cornuéjols |
The max-flow min-cut property and ±1-resistant sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 289, pp. 455-476, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
20 | Xue-Cheng Tai, Liang-Jian Deng, Ke Yin |
A Multigrid Algorithm for Maxflow and Min-Cut Problems with Applications to Multiphase Image Segmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sci. Comput. ![In: J. Sci. Comput. 87(3), pp. 101, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
20 | Bowen Liu, Zhaoying Liu, Yujian Li, Ting Zhang, Zhilin Zhang |
Iterative Min Cut Clustering Based on Graph Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Sensors ![In: Sensors 21(2), pp. 474, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
20 | Sara Omranian, Zoran Nikoloski |
CUBCO: Prediction of Protein Complexes Based on Min-cut Network Partitioning into Biclique Spanned Subgraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COMPLEX NETWORKS ![In: Complex Networks & Their Applications X - Volume 2, Proceedings of the Tenth International Conference on Complex Networks and Their Applications COMPLEX NETWORKS 2021, Madrid, Spain, November 30 - December 2, 2021, pp. 605-615, 2021, Springer, 978-3-030-93413-2. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
20 | Nada Alzaben, Daniel W. Engels |
End-to-End Routing in SDN Controllers Using Max-Flow Min-Cut Route Selection Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICACT ![In: 23rd International Conference on Advanced Communication Technology, ICACT 2021, Pyeongchang, South Korea, February 7-10, 2021, pp. 461-467, 2021, IEEE, 979-11-88428-06-9. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
20 | Andreas Lochbihler |
A Mechanized Proof of the Max-Flow Min-Cut Theorem for Countable Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITP ![In: 12th International Conference on Interactive Theorem Proving, ITP 2021, June 29 to July 1, 2021, Rome, Italy (Virtual Conference)., pp. 25:1-25:18, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-188-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
20 | Michal Dory, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai |
Distributed weighted min-cut in nearly-optimal time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021., pp. 1144-1153, 2021, ACM, 978-1-4503-8053-9. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
20 | Ke Liu, Hongchao Ma, Haichi Ma, Zhan Cai, Liang Zhang |
Building Extraction from Airborne LiDAR Data Based on Min-Cut and Improved Post-Processing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Remote. Sens. ![In: Remote. Sens. 12(17), pp. 2849, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
20 | Gregor Matl, Stanislav Zivný |
Using a Min-Cut Generalisation to Go Beyond Boolean Surjective VCSPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 82(12), pp. 3492-3520, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
20 | Michal Dory, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai |
Distributed Weighted Min-Cut in Nearly-Optimal Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2004.09129, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
20 | Carlos G. Vallejo, José A. Troyano, Fernando Enríquez, F. Javier Ortega, Fermín L. Cruz |
MCFS: Min-cut-based feature-selection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Knowl. Based Syst. ![In: Knowl. Based Syst. 195, pp. 105604, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
20 | Pu Zhao 0002, Jia Yu 0005, Hanlin Zhang, Zhan Qin, Cong Wang 0001 |
How to Securely Outsource Finding the Min-Cut of Undirected Edge-Weighted Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Forensics Secur. ![In: IEEE Trans. Inf. Forensics Secur. 15, pp. 315-328, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
20 | 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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Sensors ![In: Sensors 20(2), pp. 375, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
20 | Xiaojun Chen 0006, Weijun Hong, Feiping Nie 0001, Joshua Zhexue Huang, Li Shen 0001 |
Enhanced Balanced Min Cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Vis. ![In: Int. J. Comput. Vis. 128(7), pp. 1982-1995, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
20 | Xiaojun Chen 0006, Renjie Chen 0004, Qingyao Wu, Yixiang Fang, Feiping Nie 0001, Joshua Zhexue Huang |
LABIN: Balanced Min Cut for Large-Scale Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Neural Networks Learn. Syst. ![In: IEEE Trans. Neural Networks Learn. Syst. 31(3), pp. 725-736, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
20 | Jason Li 0006, Debmalya Panigrahi |
Deterministic Min-cut in Poly-logarithmic Max-flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16-19, 2020, pp. 85-92, 2020, IEEE, 978-1-7281-9621-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
20 | Hassna Irzan, Lucas Fidon, Tom Vercauteren, Sébastien Ourselin, Neil Marlow, Andrew Melbourne |
Min-Cut Max-Flow for Network Abnormality Detection: Application to Preterm Birth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
UNSURE/GRAIL@MICCAI ![In: Uncertainty for Safe Utilization of Machine Learning in Medical Imaging, and Graphs in Biomedical Image Analysis - Second International Workshop, UNSURE 2020, and Third International Workshop, GRAIL 2020, Held in Conjunction with MICCAI 2020, Lima, Peru, October 8, 2020, Proceedings, pp. 164-173, 2020, Springer, 978-3-030-60364-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
20 | Chase Cook, Wentian Jin, Sheldon X.-D. Tan |
GPU-based Ising Computing for Solving Balanced Min-Cut Graph Partitioning Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1908.00210, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
20 | Søren Riis, Maximilien Gadouleau |
Max-flow min-cut theorems on dispersion and entropy measures for communication networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 267, pp. 49-73, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
20 | Chung Chan, Ali Al-Bashabsheh, Da Sun Handason Tam, Chao Zhao |
Finding Better Web Communities in Digraphs via Max-Flow Min-Cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISIT ![In: IEEE International Symposium on Information Theory, ISIT 2019, Paris, France, July 7-12, 2019, pp. 410-414, 2019, IEEE, 978-1-5386-9291-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
20 | Franz Rendl, Renata Sotirov |
The min-cut and vertex separator problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Optim. Appl. ![In: Comput. Optim. Appl. 69(1), pp. 159-187, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
20 | Gramoz Goranci, Monika Henzinger, Mikkel Thorup |
Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 14(2), pp. 17:1-17:21, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
20 | Sumalee Sangamuang, Pruet Boonma, Juggapong Natwichai |
iDBP: A Distributed Min-Cut Density-Balanced Algorithm for Incremental Web-Pages Ranking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
3PGCIC ![In: Advances on P2P, Parallel, Grid, Cloud and Internet Computing, Proceedings of the 13th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing, 3PGCIC-2018, Taichung, Taiwan, 27-29 October., pp. 3-13, 2018, Springer, 978-3-030-02606-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
20 | Bashir Isa Dodo, Yongmin Li 0001, Khalid Eltayef, Xiaohui Liu 0001 |
Min-Cut Segmentation of Retinal OCT Images. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIOSTEC (Selected Papers) ![In: Biomedical Engineering Systems and Technologies - 11th International Joint Conference, BIOSTEC 2018, Funchal, Madeira, Portugal, January 19-21, 2018, Revised Selected Papers, pp. 86-99, 2018, Springer, 978-3-030-29195-2. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
20 | Varun Ramesh, Shivanee Nagarajan, Jason J. Jung, Saswati Mukherjee |
Max-flow min-cut algorithm with application to road networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Concurr. Comput. Pract. Exp. ![In: Concurr. Comput. Pract. Exp. 29(11), 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
20 | Peter Lammich, S. Reza Sefidgar |
Flow Networks and the Min-Cut-Max-Flow Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Formal Proofs ![In: Arch. Formal Proofs 2017, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
20 | Sunil Mathew, John N. Mordeson |
Directed Fuzzy Networks as a Model to Illicit Flows and Max Flow Min Cut Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
New Math. Nat. Comput. ![In: New Math. Nat. Comput. 13(3), pp. 219-229, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
20 | Xiaojun Chen 0006, Joshua Zhexue Huang, Feiping Nie 0001, Renjie Chen 0004, Qingyao Wu |
A Self-Balanced Min-Cut Algorithm for Image Clustering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCV ![In: IEEE International Conference on Computer Vision, ICCV 2017, Venice, Italy, October 22-29, 2017, pp. 2080-2088, 2017, IEEE Computer Society, 978-1-5386-1032-9. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
20 | Stefania Sardellitti, Sergio Barbarossa, Paolo Di Lorenzo |
Graph Fourier Transform for directed graphs based on Lovász extension of min-cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICASSP ![In: 2017 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2017, New Orleans, LA, USA, March 5-9, 2017, pp. 3894-3898, 2017, IEEE, 978-1-5090-4117-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
20 | Martin D. F. Wong, Hannah Honghua Yang |
Circuit Partitioning: A Network-Flow-Based Balanced Min-Cut Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Algorithms ![In: Encyclopedia of Algorithms - 2016 Edition, pp. 295-301, 2016, Springer, 978-1-4939-2863-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
20 | Gianpiero Bianchi, Renato Bruni, Alessandra Reale, Fabio Sforzi |
A min-cut approach to functional regionalization, with a case study of the Italian local labour market areas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optim. Lett. ![In: Optim. Lett. 10(5), pp. 955-973, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
20 | Yao Zhu, David F. Gleich |
A parallel min-cut algorithm using iteratively reweighted least squares targeting at problems with floating-point edge weights. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Parallel Comput. ![In: Parallel Comput. 59, pp. 43-59, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
20 | Gramoz Goranci, Monika Henzinger, Mikkel Thorup |
Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1611.06500, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
20 | Kensuke Otsuki, Yusuke Kobayashi 0001, Kazuo Murota |
Improved max-flow min-cut algorithms in a Circular Disk Failure Model with application to a road network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 248(2), pp. 396-403, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
20 | Andreas Lochbihler |
A Formal Proof of the Max-Flow Min-Cut Theorem for Countable Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Formal Proofs ![In: Arch. Formal Proofs 2016, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
20 | Mohsen Ghaffari 0001, Bernhard Haeupler |
Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, pp. 202-219, 2016, SIAM, 978-1-61197-433-1. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
20 | Gramoz Goranci, Monika Henzinger, Mikkel Thorup |
Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 24th Annual European Symposium on Algorithms, ESA 2016, August 22-24, 2016, Aarhus, Denmark, pp. 46:1-46:17, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-015-6. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
20 | Varun Ramesh, Shivanee Nagarajan, Saswati Mukherjee |
Max-flow Min-cut Algorithm in Spark with Application to Road Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BDTA ![In: Big Data Technologies and Applications - 7th International Conference, BDTA 2016, Seoul, South Korea, November 17-18, 2016, Proceedings, pp. 12-22, 2016, Springer, 978-3-319-58966-4. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
20 | Ali Gaber, Karim G. Seddik, Ayman Y. Elezabi |
PMUs placement with max-flow min-cut communication constraint in smart grids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WCNC ![In: IEEE Wireless Communications and Networking Conference, WCNC 2016, Doha, Qatar, April 3-6, 2016, pp. 1-6, 2016, IEEE, 978-1-4673-9814-5. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
20 | Sebastian Neumayer, Alon Efrat, Eytan H. Modiano |
Geographic max-flow and min-cut under a circular disk failure model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Networks ![In: Comput. Networks 77, pp. 117-127, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
20 | Yao Zhu, David F. Gleich |
A Parallel Min-Cut Algorithm using Iteratively Reweighted Least Squares. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1501.03105, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
20 | Shawn X. Cui, Michael H. Freedman, Or Sattath, Richard Stong, Greg Minton |
Quantum Max-flow/Min-cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1508.04644, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
20 | Daniel Golovin, Vineet Goyal, Valentin Polishchuk, R. Ravi 0001, Mikko Sysikaski |
Improved approximations for two-stage min-cut and shortest path problems under uncertainty. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 149(1-2), pp. 167-194, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
20 | Ahmad Humayun, Fuxin Li, James M. Rehg |
The Middle Child Problem: Revisiting Parametric Min-Cut and Seeds for Object Proposals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCV ![In: 2015 IEEE International Conference on Computer Vision, ICCV 2015, Santiago, Chile, December 7-13, 2015, pp. 1600-1608, 2015, IEEE Computer Society, 978-1-4673-8391-2. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
20 | Yunfan Ye, Hongtao Zhang 0001, Xin Xiong, Yang Liu 0024 |
Dynamic Min-Cut Clustering for Energy Savings in Ultra-Dense Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VTC Fall ![In: IEEE 82nd Vehicular Technology Conference, VTC Fall 2015, Boston, MA, USA, September 6-9, 2015, pp. 1-5, 2015, IEEE, 978-1-4799-8091-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
20 | Brian L. Davis, William A. Barrett, Scott D. Swingle |
Min-cut segmentation of cursive handwriting in tabular documents. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DRR ![In: Document Recognition and Retrieval XXII, San Francisco, California, USA, February 11-12, 2015., pp. 940208, 2015, SPIE, 978-1-6284-1492-9. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
20 | Qinghong Zhong, Ying Wang 0002, Luoming Meng, Ailing Xiao, Hongjing Zhang |
A max-flow/min-cut theory based multi-domain virtual network splitting mechanism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APNOMS ![In: 17th Asia-Pacific Network Operations and Management Symposium, APNOMS 2015, Busan, South Korea, August 19-21, 2015, pp. 392-395, 2015, IEEE, 978-4-8855-2296-3. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
20 | Volkan Yazici, Cevdet Aykanat |
Constrained Min-Cut Replication for K-Way Hypergraph Partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFORMS J. Comput. ![In: INFORMS J. Comput. 26(2), pp. 303-320, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
20 | Jing Yuan 0001, Egil Bae, Xue-Cheng Tai, Yuri Boykov |
A spatially continuous max-flow and min-cut framework for binary labeling problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Numerische Mathematik ![In: Numerische Mathematik 126(3), pp. 559-587, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
20 | Raúl H. Etkin, Farzad Parvaresh, Ilan Shomorony, Amir Salman Avestimehr |
Computing Half-Duplex Schedules in Gaussian Relay Networks via Min-Cut Approximations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 60(11), pp. 7204-7220, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
20 | Amy Fu, Parastoo Sadeghi, Muriel Médard |
Beyond the Min-Cut Bound: Deterministic Network Coding for Asynchronous Multirate Broadcast. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1401.0543, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
20 | Xiaojun Chang, Feiping Nie 0001, Zhigang Ma, Yi Yang 0001 |
Balanced k-Means and Min-Cut Clustering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1411.6235, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
20 | Oliver Kosut |
Max-flow min-cut for power system security index computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAM ![In: IEEE 8th Sensor Array and Multichannel Signal Processing Workshop, SAM 2014, A Coruna, Spain, June 22-25, 2014, pp. 61-64, 2014, IEEE, 978-1-4799-1481-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
20 | Yusuke Kobayashi 0001, Kensuke Otsuki |
Max-flow min-cut theorem and faster algorithms in a circular disk failure model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFOCOM ![In: 2014 IEEE Conference on Computer Communications, INFOCOM 2014, Toronto, Canada, April 27 - May 2, 2014, pp. 1635-1643, 2014, IEEE, 978-14799-3360-0. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
20 | Raúl H. Etkin, Farzad Parvaresh, Ilan Shomorony, Amir Salman Avestimehr |
On Min-Cut Algorithms for Half-Duplex Relay Networks ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1305.2548, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
20 | Brijesh Kumar Rai, Niladri Das |
Sum-Networks: Min-Cut = 2 Does Not Guarantee Solvability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Commun. Lett. ![In: IEEE Commun. Lett. 17(11), pp. 2144-2147, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
20 | Raúl H. Etkin, Farzad Parvaresh, Ilan Shomorony, Amir Salman Avestimehr |
On efficient min-cut approximations in half-duplex relay networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISIT ![In: Proceedings of the 2013 IEEE International Symposium on Information Theory, Istanbul, Turkey, July 7-12, 2013, pp. 1949-1953, 2013, IEEE, 978-1-4799-0446-4. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
20 | Robert Ghrist, Sanjeevi Krishnan |
A topological max-flow-min-cut theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GlobalSIP ![In: IEEE Global Conference on Signal and Information Processing, GlobalSIP 2013, Austin, TX, USA, December 3-5, 2013, pp. 815-818, 2013, IEEE, 978-1-4799-0248-4. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
20 | Alexander Engels, Michael Reyer, Andreas Steiger, Rudolf Mathar |
Min-cut based partitioning for urban LTE cell site planning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCNC ![In: 10th IEEE Consumer Communications and Networking Conference, CCNC 2013, Las Vegas, NV, USA, January 11-14, 2013, pp. 515-520, 2013, IEEE, 978-1-4673-3131-9. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
20 | Nan Wang 0003, Song Chen 0001, Takeshi Yoshimura |
Min-cut based leakage power aware scheduling in high-level synthesis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISQED ![In: International Symposium on Quality Electronic Design, ISQED 2013, Santa Clara, CA, USA, March 4-6, 2013, pp. 164-169, 2013, IEEE, 978-1-4673-4951-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
20 | Agustin Sancen-Plaza, Andres Mendez-Vazquez |
Influence maximization for Big Data through entropy ranking and min-cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CollaborateCom ![In: 9th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing, Austin, TX, USA, October 20-23, 2013, pp. 87-95, 2013, ICST / IEEE, 978-1-936968-92-3. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
20 | Haiqi Wang, Sheqin Dong, Tao Lin, Song Chen 0001, Satoshi Goto |
Novel Voltage Choice and Min-Cut Based Assignment for Dual-VDD System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Trans. Fundam. Electron. Commun. Comput. Sci. ![In: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 95-A(12), pp. 2208-2219, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
20 | Anoosheh Heidarzadeh, Amir H. Banihashemi |
How Fast Can Dense Codes Achieve the Min-Cut Capacity of Line Networks? ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1202.0343, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
20 | Julien M. Hendrickx, Karl Henrik Johansson, Raphaël M. Jungers, Henrik Sandberg, Kin Cheong Sou |
An Exact Solution to the Power Networks Security Index Problem and its Generalized Min Cut Formulation ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1204.6174, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
20 | Anoosheh Heidarzadeh, Amir H. Banihashemi |
How fast can dense codes achieve the min-cut capacity of line networks? ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISIT ![In: Proceedings of the 2012 IEEE International Symposium on Information Theory, ISIT 2012, Cambridge, MA, USA, July 1-6, 2012, pp. 2461-2465, 2012, IEEE, 978-1-4673-2580-6. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
20 | Dragana Bajovic, João Manuel Freitas Xavier, José M. F. Moura, Bruno Sinopoli |
Exact rate for convergence in probability of averaging processes via generalized min-cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CDC ![In: Proceedings of the 51th IEEE Conference on Decision and Control, CDC 2012, December 10-13, 2012, Maui, HI, USA, pp. 2718-2725, 2012, IEEE, 978-1-4673-2065-8. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
20 | Ying Liu, K. D. Prathapasinghe Dharmawansa, Matthew R. McKay |
Max-flow min-cut outage characterization of dual-hop relay channels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Allerton Conference ![In: 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012, Allerton Park & Retreat Center, Monticello, IL, USA, October 1-5, 2012, pp. 1659-1665, 2012, IEEE, 978-1-4673-4537-8. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
20 | Sebastian Neumayer, Alon Efrat, Eytan H. Modiano |
Geographic max-flow and min-cut under a circular disk failure model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFOCOM ![In: Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, pp. 2736-2740, 2012, IEEE, 978-1-4673-0773-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
20 | Nicolas Lermé, Lucas Létocart, François Malgouyres |
Reduced graphs for min-cut/max-flow approaches in image segmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 37, pp. 63-68, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
20 | S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari |
A Max-Flow/Min-Cut Algorithm for Linear Deterministic Relay Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 57(5), pp. 3005-3015, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
Displaying result #101 - #200 of 398 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ >>] |