Search results for "min-cut"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
21	Rajat Aggarwal, Rajeev Murgai, Masahiro Fujita	Speeding up technology-independent timing optimization by network partitioning.	ICCAD	1997	DBLP DOI BibTeX RDF
21	Peter Ramyalal Suaris, Gershon Kedem	A quadrisection-based combined place and route scheme for standard cells.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1989	DBLP DOI BibTeX RDF
21	Lov K. Grover	Standard Cell Placement Using Simulated Sintering.	DAC	1987	DBLP DOI BibTeX RDF
20	Andrew Delong, Yuri Boykov	A Scalable graph-cut algorithm for N-D grids.	CVPR	2008	DBLP DOI BibTeX RDF
20	Liza Fireman, Erez Petrank, Ayal Zaks	New Algorithms for SIMD Alignment.	CC	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.	EvoWorkshops	2004	DBLP DOI BibTeX RDF
20	Navaratnasothie Selvakkumaran, Abhishek Ranjan, Salil Raje, George Karypis	Multi-resource aware partitioning algorithms for FPGAs with heterogeneous resources.	DAC	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.	STOC	2002	DBLP DOI BibTeX RDF
20	Daniel R. Brasen, Gabriele Saucier	Using cone structures for circuit partitioning into FPGA packages.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	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.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1997	DBLP DOI BibTeX RDF
20	G. Gayathri, Sunil Mathew, John N. Mordeson	Max-flow min-cut theorem for directed fuzzy incidence networks.	J. Appl. Math. Comput.	2024	DBLP DOI BibTeX RDF
20	Wenyu Jin 0001, Xiaorui Sun, Mikkel Thorup	Fully Dynamic Min-Cut of Superconstant Size in Subpolynomial Time.	CoRR	2024	DBLP DOI BibTeX RDF
20	Matthew Broussard, Bala Krishnamoorthy	A tight max-flow min-cut duality theorem for nonlinear multicommodity flows.	J. Comb. Optim.	2024	DBLP DOI BibTeX RDF
20	Wenyu Jin 0001, Xiaorui Sun, Mikkel Thorup	Fully Dynamic Min-Cut of Superconstant Size in Subpolynomial Time.	SODA	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.	IEEE Trans. Pattern Anal. Mach. Intell.	2023	DBLP DOI BibTeX RDF
20	Trust Tawanda, Philimon Nyamugure, Elias Munapo, Santosh Kumar	Extreme Min - Cut Max - Flow Algorithm.	Int. J. Appl. Metaheuristic Comput.	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.	SODA	2023	DBLP DOI BibTeX RDF
20	Maxwell Allman, Venus Lo, S. Thomas McCormick	Complexity of Source-Sink Monotone 2-parameter min cut.	Oper. Res. Lett.	2022	DBLP DOI BibTeX RDF
20	Mohsen Ghaffari 0001, Goran Zuzic	Universally-Optimal Distributed Exact Min-Cut.	CoRR	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.	CoRR	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.	CoRR	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.	J. Autom. Reason.	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.	Appl. Netw. Sci.	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.	ICACT	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.	ICACT	2022	DBLP DOI BibTeX RDF
20	Mohsen Ghaffari 0001, Goran Zuzic	Universally-Optimal Distributed Exact Min-Cut.	PODC	2022	DBLP DOI BibTeX RDF
20	Jason Li 0006, Debmalya Panigrahi	Deterministic Min-cut in Poly-logarithmic Max-flows.	CoRR	2021	DBLP BibTeX RDF
20	Nengkun Yu	Quantum Max-Flow Min-Cut theorem.	CoRR	2021	DBLP BibTeX RDF
20	Matthew Broussard, Bala Krishnamoorthy	A Tight Max-Flow Min-Cut Duality Theorem for Non-Linear Multicommodity Flows.	CoRR	2021	DBLP BibTeX RDF
20	Maxwell Allman, Venus Lo, S. Thomas McCormick	Complexity of Source-Sink Monotone 2-Parameter Min Cut.	CoRR	2021	DBLP BibTeX RDF
20	Ahmad Abdi, Gérard Cornuéjols	The max-flow min-cut property and ±1-resistant sets.	Discret. Appl. Math.	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.	J. Sci. Comput.	2021	DBLP DOI BibTeX RDF
20	Bowen Liu, Zhaoying Liu, Yujian Li, Ting Zhang, Zhilin Zhang	Iterative Min Cut Clustering Based on Graph Cuts.	Sensors	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.	COMPLEX NETWORKS	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.	ICACT	2021	DBLP DOI BibTeX RDF
20	Andreas Lochbihler	A Mechanized Proof of the Max-Flow Min-Cut Theorem for Countable Networks.	ITP	2021	DBLP DOI BibTeX RDF
20	Michal Dory, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai	Distributed weighted min-cut in nearly-optimal time.	STOC	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.	Remote. Sens.	2020	DBLP DOI BibTeX RDF
20	Gregor Matl, Stanislav Zivný	Using a Min-Cut Generalisation to Go Beyond Boolean Surjective VCSPs.	Algorithmica	2020	DBLP DOI BibTeX RDF
20	Michal Dory, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai	Distributed Weighted Min-Cut in Nearly-Optimal Time.	CoRR	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.	Knowl. Based Syst.	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.	IEEE Trans. Inf. Forensics Secur.	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.	Sensors	2020	DBLP DOI BibTeX RDF
20	Xiaojun Chen 0006, Weijun Hong, Feiping Nie 0001, Joshua Zhexue Huang, Li Shen 0001	Enhanced Balanced Min Cut.	Int. J. Comput. Vis.	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.	IEEE Trans. Neural Networks Learn. Syst.	2020	DBLP DOI BibTeX RDF
20	Jason Li 0006, Debmalya Panigrahi	Deterministic Min-cut in Poly-logarithmic Max-flows.	FOCS	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.	UNSURE/GRAIL@MICCAI	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.	CoRR	2019	DBLP BibTeX RDF
20	Søren Riis, Maximilien Gadouleau	Max-flow min-cut theorems on dispersion and entropy measures for communication networks.	Inf. Comput.	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.	ISIT	2019	DBLP DOI BibTeX RDF
20	Franz Rendl, Renata Sotirov	The min-cut and vertex separator problem.	Comput. Optim. Appl.	2018	DBLP DOI BibTeX RDF
20	Gramoz Goranci, Monika Henzinger, Mikkel Thorup	Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time.	ACM Trans. Algorithms	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.	3PGCIC	2018	DBLP DOI BibTeX RDF
20	Bashir Isa Dodo, Yongmin Li 0001, Khalid Eltayef, Xiaohui Liu 0001	Min-Cut Segmentation of Retinal OCT Images.	BIOSTEC (Selected Papers)	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.	Concurr. Comput. Pract. Exp.	2017	DBLP DOI BibTeX RDF
20	Peter Lammich, S. Reza Sefidgar	Flow Networks and the Min-Cut-Max-Flow Theorem.	Arch. Formal Proofs	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.	New Math. Nat. Comput.	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.	ICCV	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.	ICASSP	2017	DBLP DOI BibTeX RDF
20	Martin D. F. Wong, Hannah Honghua Yang	Circuit Partitioning: A Network-Flow-Based Balanced Min-Cut Approach.	Encyclopedia of Algorithms	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.	Optim. Lett.	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.	Parallel Comput.	2016	DBLP DOI BibTeX RDF
20	Gramoz Goranci, Monika Henzinger, Mikkel Thorup	Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time.	CoRR	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.	Eur. J. Oper. Res.	2016	DBLP DOI BibTeX RDF
20	Andreas Lochbihler	A Formal Proof of the Max-Flow Min-Cut Theorem for Countable Networks.	Arch. Formal Proofs	2016	DBLP BibTeX RDF
20	Mohsen Ghaffari 0001, Bernhard Haeupler	Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut.	SODA	2016	DBLP DOI BibTeX RDF
20	Gramoz Goranci, Monika Henzinger, Mikkel Thorup	Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time.	ESA	2016	DBLP DOI BibTeX RDF
20	Varun Ramesh, Shivanee Nagarajan, Saswati Mukherjee	Max-flow Min-cut Algorithm in Spark with Application to Road Networks.	BDTA	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.	WCNC	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.	Comput. Networks	2015	DBLP DOI BibTeX RDF
20	Yao Zhu, David F. Gleich	A Parallel Min-Cut Algorithm using Iteratively Reweighted Least Squares.	CoRR	2015	DBLP BibTeX RDF
20	Shawn X. Cui, Michael H. Freedman, Or Sattath, Richard Stong, Greg Minton	Quantum Max-flow/Min-cut.	CoRR	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.	Math. Program.	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.	ICCV	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.	VTC Fall	2015	DBLP DOI BibTeX RDF
20	Brian L. Davis, William A. Barrett, Scott D. Swingle	Min-cut segmentation of cursive handwriting in tabular documents.	DRR	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.	APNOMS	2015	DBLP DOI BibTeX RDF
20	Volkan Yazici, Cevdet Aykanat	Constrained Min-Cut Replication for K-Way Hypergraph Partitioning.	INFORMS J. Comput.	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.	Numerische Mathematik	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.	IEEE Trans. Inf. Theory	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.	CoRR	2014	DBLP BibTeX RDF
20	Xiaojun Chang, Feiping Nie 0001, Zhigang Ma, Yi Yang 0001	Balanced k-Means and Min-Cut Clustering.	CoRR	2014	DBLP BibTeX RDF
20	Oliver Kosut	Max-flow min-cut for power system security index computation.	SAM	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.	INFOCOM	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	CoRR	2013	DBLP BibTeX RDF
20	Brijesh Kumar Rai, Niladri Das	Sum-Networks: Min-Cut = 2 Does Not Guarantee Solvability.	IEEE Commun. Lett.	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.	ISIT	2013	DBLP DOI BibTeX RDF
20	Robert Ghrist, Sanjeevi Krishnan	A topological max-flow-min-cut theorem.	GlobalSIP	2013	DBLP DOI BibTeX RDF
20	Alexander Engels, Michael Reyer, Andreas Steiger, Rudolf Mathar	Min-cut based partitioning for urban LTE cell site planning.	CCNC	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.	ISQED	2013	DBLP DOI BibTeX RDF
20	Agustin Sancen-Plaza, Andres Mendez-Vazquez	Influence maximization for Big Data through entropy ranking and min-cut.	CollaborateCom	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.	IEICE Trans. Fundam. Electron. Commun. Comput. Sci.	2012	DBLP DOI BibTeX RDF
20	Anoosheh Heidarzadeh, Amir H. Banihashemi	How Fast Can Dense Codes Achieve the Min-Cut Capacity of Line Networks?	CoRR	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	CoRR	2012	DBLP BibTeX RDF
20	Anoosheh Heidarzadeh, Amir H. Banihashemi	How fast can dense codes achieve the min-cut capacity of line networks?	ISIT	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.	CDC	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.	Allerton Conference	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.	INFOCOM	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.	Electron. Notes Discret. Math.	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.	IEEE Trans. Inf. Theory	2011	DBLP DOI BibTeX RDF