Search results for "Max-flow/min-cut"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
104	Jianmin Li, John Lillis, Chung-Kuan Cheng	Linear decomposition algorithm for VLSI design applications.	ICCAD	1995	DBLP DOI BibTeX RDF	linear placement, max-flow min-cut, eigenvector, circuit partitioning
99	Xijin Yan, Jun Yang, Zhen Zhang 0010	An outer bound for multisource multisink network coding with minimum cost consideration.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF	K-pairs transmission, max-flow min-cut bound, multisource multisink network, network sharing bound, three-layer network, network coding, side information
81	Frank Thomson Leighton, Satish Rao	An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms	FOCS	1988	DBLP DOI BibTeX RDF	max-flow min-cut theorem, minimum quotient separators, 1/3-2/3 separators, VLSI layout area, approximation algorithms, distributed networks, bifurcators, crossing number, multicommodity flow problems, optimal approximation
78	José M. Bioucas-Dias, Gonçalo Valadão	Phase unwrapping: a new max-flow/min-cut based approach.	ICIP (2)	2005	DBLP DOI BibTeX RDF
74	Xue-Bin Liang	Matrix games in the multicast networks: maximum information flows with network switching.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF	achievable information rate regions, matrix games, max-flow min-cut theorems, maximum information flows, multisource multicast networks, network switching, route packings, switching gaps, game theory, network coding, multicast routes, set-covering problems
72	Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman	Single source multiroute flows and cuts on uniform capacity networks.	SODA	2007	DBLP BibTeX RDF
64	Hannah Honghua Yang, Martin D. F. Wong	Balanced partitioning.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1996	DBLP DOI BibTeX RDF
64	Maren Martens, S. Thomas McCormick	A Polynomial Algorithm for Weighted Abstract Flow.	IPCO	2008	DBLP DOI BibTeX RDF
63	Yuri Boykov, Vladimir Kolmogorov	An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision.	IEEE Trans. Pattern Anal. Mach. Intell.	2004	DBLP DOI BibTeX RDF
62	Yuanning Li, Yonghong Tian 0001, Jingjing Yang, Ling-Yu Duan, Wen Gao 0001	Video retargeting with multi-scale trajectory optimization.	Multimedia Information Retrieval	2010	DBLP DOI BibTeX RDF	max-flow/min-cut, multi-scale trajectory optimization, spatio-temporal saliency, video retargeting
52	Bertrand Guenin	A Short Proof of Seymour's Characterization of the Matroids with the Max-Flow Min-Cut Property.	IPCO	2002	DBLP DOI BibTeX RDF
44	Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin	Maximum Flow Problem.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Minimum cut problem, Augmenting path algorithm, Preflow-push algorithm, Max-flow min-cut theorem, Network, Maximum flow problem
44	Antonin Chambolle, Jérôme Darbon	On Total Variation Minimization and Surface Evolution Using Parametric Maximum Flows.	Int. J. Comput. Vis.	2009	DBLP DOI BibTeX RDF	Crystalline and anisotropic mean curvature flow, Max-flow/min-cut, Parametric max-flow algorithms, Total variation, Submodular functions, Variational approaches
44	Liang-Liang Xie, Panganamala R. Kumar	On the path-loss attenuation regime for positive cost and linear scaling of transport capacity in wireless networks.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF	capacity of wireless networks, cut-set bound, max-flow min-cut bound, multiuser information theory, ad hoc networks, wireless networks, scaling laws, transport capacity, network information theory
44	Jingtao Yu, Pingyi Fan, Kai Cai	Capacity analysis of maximal flow in ad hoc networks.	IWCMC	2006	DBLP DOI BibTeX RDF	max-flow min-cut, routing, network coding, random graph, network capacity
44	Georg Baier, Ekkehard Köhler, Martin Skutella	The k-Splittable Flow Problem.	Algorithmica	2005	DBLP DOI BibTeX RDF	Max-flow min-cut, Approximation algorithm, Network flow, Unsplittable flow
44	Ioannis C. Avramopoulos, Miltiades E. Anagnostou	Optimal Component Configuration and Component Routing.	IEEE Trans. Mob. Comput.	2002	DBLP DOI BibTeX RDF	component allocation, component mobility, multiterminal cuts, max flow—min cut, mixed binary integer programming, Mobile agents, reconfiguration, NP-hard problems
44	Jon M. Kleinberg	Single-Source Unsplittable Flow.	FOCS	1996	DBLP DOI BibTeX RDF	max-flow min-cut, scheduling, load balancing, generalization, NP-hard, unsplittable flow, machine scheduling, capacity constraints
44	Philip N. Klein, Ajit Agrawal, R. Ravi 0001, Satish Rao	Approximation through Multicommodity Flow	FOCS	1990	DBLP DOI BibTeX RDF	minimum deletion, max-flow-min-cut theorem, approximation algorithms, multicommodity flow
40	Honghua Yang, D. F. Wong 0001	Efficient network flow based min-cut balanced partitioning.	ICCAD	1994	DBLP DOI BibTeX RDF
38	Philip N. Klein, Satish Rao, Ajit Agrawal, R. Ravi 0001	An Approximate Max-Flow Min-Cut Relation for Unidirected Multicommodity Flow, with Applications.	Comb.	1995	DBLP DOI BibTeX RDF
38	Hiroshi Nagamochi, Toshihide Ibaraki	On Max-Flow Min-Cut and Integral Flow Properties for Multicommodity Flows in Directed Networks.	Inf. Process. Lett.	1989	DBLP DOI BibTeX RDF
38	Klaus Truemper	Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes.	Math. Oper. Res.	1987	DBLP DOI BibTeX RDF
38	Richard G. Ogier	Flow Optimization in Dynamic and Continuous Networks (Polymatroids, Submodular, Max-Flow Min-Cut)		1985	RDF
37	Jittat Fakcharoenphol, Kunal Talwar	An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor.	RANDOM-APPROX	2003	DBLP DOI BibTeX RDF
36	Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor	A general approach to online network optimization problems.	ACM Trans. Algorithms	2006	DBLP DOI BibTeX RDF	Online network optimization, group Steiner, multi-cuts, competitive analysis, facility location, randomized rounding
33	Ishai Menache, Shie Mannor, Nahum Shimkin	Q-Cut - Dynamic Discovery of Sub-goals in Reinforcement Learning.	ECML	2002	DBLP DOI BibTeX RDF
33	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
33	Matthew Broussard, Bala Krishnamoorthy	A tight max-flow min-cut duality theorem for nonlinear multicommodity flows.	J. Comb. Optim.	2024	DBLP DOI BibTeX RDF
33	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
33	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
33	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
33	Nengkun Yu	Quantum Max-Flow Min-Cut theorem.	CoRR	2021	DBLP BibTeX RDF
33	Matthew Broussard, Bala Krishnamoorthy	A Tight Max-Flow Min-Cut Duality Theorem for Non-Linear Multicommodity Flows.	CoRR	2021	DBLP BibTeX RDF
33	Ahmad Abdi, Gérard Cornuéjols	The max-flow min-cut property and ±1-resistant sets.	Discret. Appl. Math.	2021	DBLP DOI BibTeX RDF
33	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
33	Andreas Lochbihler	A Mechanized Proof of the Max-Flow Min-Cut Theorem for Countable Networks.	ITP	2021	DBLP DOI BibTeX RDF
33	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
33	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
33	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
33	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
33	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
33	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
33	Andreas Lochbihler	A Formal Proof of the Max-Flow Min-Cut Theorem for Countable Networks.	Arch. Formal Proofs	2016	DBLP BibTeX RDF
33	Varun Ramesh, Shivanee Nagarajan, Saswati Mukherjee	Max-flow Min-cut Algorithm in Spark with Application to Road Networks.	BDTA	2016	DBLP DOI BibTeX RDF
33	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
33	Shawn X. Cui, Michael H. Freedman, Or Sattath, Richard Stong, Greg Minton	Quantum Max-flow/Min-cut.	CoRR	2015	DBLP BibTeX RDF
33	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
33	Oliver Kosut	Max-flow min-cut for power system security index computation.	SAM	2014	DBLP DOI BibTeX RDF
33	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
33	Robert Ghrist, Sanjeevi Krishnan	A topological max-flow-min-cut theorem.	GlobalSIP	2013	DBLP DOI BibTeX RDF
33	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
33	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
33	Ron Aharoni, Eli Berger, Agelos Georgakopoulos, Amitai Perlstein, Philipp Sprüssel	The Max-Flow Min-Cut theorem for countable networks.	J. Comb. Theory, Ser. B	2011	DBLP DOI BibTeX RDF
33	Ananda S. Chowdhury, Suchendra M. Bhandarkar, Robert W. Robinson, Jack C. Yu, Tianming Liu 0001	Detection of hairline mandibular fracture using max-flow min-cut and Kolmogorov-Smirnov distance.	ISBI	2011	DBLP DOI BibTeX RDF
33	Maximilien Gadouleau, Søren Riis	Max-flow min-cut theorem for Rényi entropy in communication networks.	ISIT	2011	DBLP DOI BibTeX RDF
33	Amir Massoudi, Arcot Sowmya, Katarina Mele, Dimitri Semenovich	Employing temporal information for cell segmentation using max-flow/min-cut in phase-contrast video microscopy.	EMBC	2011	DBLP DOI BibTeX RDF
33	José Martínez-Bernal, Edwin O'Shea, Rafael H. Villarreal	Ehrhart Clutters: Regularity and Max-Flow Min-Cut.	Electron. J. Comb.	2010	DBLP DOI BibTeX RDF
33	Maximilien Gadouleau, Søren Riis	Max-Flow Min-Cut Theorems for Communication Networks Based on Equational Logic	CoRR	2010	DBLP BibTeX RDF
33	S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari	A Max-Flow/Min-Cut Algorithm for a Class of Wireless Networks.	SODA	2010	DBLP DOI BibTeX RDF
33	Rui A. Costa, João Barros	A Max-Flow Min-Cut Theorem with Applications in Small Worlds and Dual Radio Networks	CoRR	2008	DBLP BibTeX RDF
33	Masahiro Hachimori, M. Nakamura	The max-flow min-cut property of two-dimensional affine convex geometries.	Discret. Math.	2008	DBLP DOI BibTeX RDF
33	Mohammad Taghi Hajiaghayi, Tom Leighton	On the max-flow min-cut ratio for directed multicommodity flows.	Theor. Comput. Sci.	2006	DBLP DOI BibTeX RDF
33	Matthew W. Turek, Daniel Freedman	Multiscale Modeling and Constraints for Max-flow/Min-cut Problems in Computer Vision.	CVPR Workshops	2006	DBLP DOI BibTeX RDF
33	Bertrand Guenin	A Short Proof of Seymour's Characterization of the Matroids with the Max-Flow Min-Cut Property.	J. Comb. Theory, Ser. B	2002	DBLP DOI BibTeX RDF
33	Phil Diamond	A fuzzy max-flow min-cut theorem.	Fuzzy Sets Syst.	2001	DBLP DOI BibTeX RDF
33	Frank Thomson Leighton, Satish Rao	Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms.	J. ACM	1999	DBLP DOI BibTeX RDF	muticommocity flow, routing, approximation algorithms, graph partitioning, divide and conquer, VLSI layout, maximum flow, minimum cut, graph bisection
33	Manfred Padberg, Ting-Yi Sung	An analytic symmetrization of max flow-min cut.	Discret. Math.	1997	DBLP DOI BibTeX RDF
33	Serge A. Plotkin, Éva Tardos	Improved Bounds on the Max-Flow Min-Cut Ratio for Multicommodity Flows.	Comb.	1995	DBLP DOI BibTeX RDF
33	Serge A. Plotkin, Éva Tardos	Improved bounds on the max-flow min-cut ratio for multicommodity flows.	STOC	1993	DBLP DOI BibTeX RDF
33	Monique Laurent, Antonio Sassano	A characterization of knapsacks with the max-flow- - min-cut property.	Oper. Res. Lett.	1992	DBLP DOI BibTeX RDF
33	Dan Bienstock	Some Generalized Max-Flow Min-Cut Problems in the Plane.	Math. Oper. Res.	1991	DBLP DOI BibTeX RDF
33	Fan T. Tseng, Klaus Truemper	A decomposition of the matroids with the max-flow min-cut property.	Discret. Appl. Math.	1986	DBLP DOI BibTeX RDF
33	Paul D. Seymour	The matroids with the max-flow min-cut property.	J. Comb. Theory, Ser. B	1977	DBLP DOI BibTeX RDF
33	Alan J. Hoffman	A generalization of max flow - min cut.	Math. Program.	1974	DBLP DOI BibTeX RDF
31	José M. Bioucas-Dias, Gonçalo Valadão	Phase Unwrapping via Graph Cuts.	IEEE Trans. Image Process.	2007	DBLP DOI BibTeX RDF
31	Olivier Juan, Yuri Boykov	Capacity Scaling for Graph Cuts in Vision.	ICCV	2007	DBLP DOI BibTeX RDF
31	Huiqun Liu, Martin D. F. Wong	Network-flow-based multiway partitioning with area and pin constraints.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1998	DBLP DOI BibTeX RDF
31	Andrew Delong, Yuri Boykov	A Scalable graph-cut algorithm for N-D grids.	CVPR	2008	DBLP DOI BibTeX RDF
30	Andrew V. Goldberg, Alexander V. Karzanov	Maximum skew-symmetric flows and matchings.	Math. Program.	2004	DBLP DOI BibTeX RDF	skew-symmetric graph, matching, network flow, b-matching
29	Mala L. Radhakrishnan, Sara L. Su	Dead-End Elimination as a Heuristic for Min-Cut Image Segmentation.	ICIP	2006	DBLP DOI BibTeX RDF
29	Sidharth Jaggi, Peter Sanders 0001, Philip A. Chou, Michelle Effros, Sebastian Egner, Kamal Jain, Ludo M. G. M. Tolhuizen	Polynomial time algorithms for multicast network code construction.	IEEE Trans. Inf. Theory	2005	DBLP DOI BibTeX RDF
29	Peter Sanders 0001, Sebastian Egner, Ludo M. G. M. Tolhuizen	Polynomial time algorithms for network information flow.	SPAA	2003	DBLP DOI BibTeX RDF	communication, multicasting, randomized algorithm, finite field, coding, linear algebra, derandomization, network information theory
28	Elliot Anshelevich, David Kempe 0001, Jon M. Kleinberg	Stability of load balancing algorithms in dynamic adversarial systems.	STOC	2002	DBLP DOI BibTeX RDF
28	Songqiao Han, Shensheng Zhang, Yong Zhang 0033	A Generic Software Partitioning Algorithm for Pervasive Computing.	WASA	2006	DBLP DOI BibTeX RDF	Algorithm, Pervasive computing, Software partitioning
28	Kazuo Iwama	Classic and Quantum Network Coding.	SWAT	2006	DBLP DOI BibTeX RDF
27	José M. Bioucas-Dias, Gonçalo Valadão	Phase Unwrapping via Graph Cuts.	IbPRIA (1)	2005	DBLP DOI BibTeX RDF
26	Jose Joaquin Garcia-Luna-Aceves, Zheng Wang 0006, Hamid R. Sadjadpour, Shirish S. Karande	Optimal Unicast Capacity of Random Geometric Graphs: Impact of Multipacket Transmission and Reception.	IEEE J. Sel. Areas Commun.	2009	DBLP DOI BibTeX RDF
24	James R. Lee, Anastasios Sidiropoulos	On the geometry of graphs with a forbidden minor.	STOC	2009	DBLP DOI BibTeX RDF	forbidden minors, geometry of graphs, embeddings
24	Amir F. Dana, Radhika Gowaikar, Ravi Palanki, Babak Hassibi, Michelle Effros	Capacity of wireless erasure networks.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF
23	Debdeep Chatterjee, Tan F. Wong, Tat M. Lok	Cooperative Transmission in a Wireless Cluster Based on Flow Management.	WCNC	2008	DBLP DOI BibTeX RDF
23	Naveen Garg 0001, Rohit Khandekar	Fast Approximation Algorithms for Fractional Steiner Forest and Related Problems.	FOCS	2002	DBLP DOI BibTeX RDF
21	Rupesh S. Shelar, Sachin S. Sapatnekar	BDD decomposition for delay oriented pass transistor logic synthesis.	IEEE Trans. Very Large Scale Integr. Syst.	2005	DBLP DOI BibTeX RDF
19	Aitor del Coso, Christian Ibars	Achievable rates for the AWGN channel with multiple parallel relays.	IEEE Trans. Wirel. Commun.	2009	DBLP DOI BibTeX RDF
19	Hanife Kebapci, Berrin A. Yanikoglu, Gozde B. Unal	Plant image retrieval using color and texture features.	ISCIS	2009	DBLP DOI BibTeX RDF
19	Reinhard Klette, Ruyi Jiang, Sandino Morales, Tobi Vaudrey	Discrete Driver Assistance.	ISMM	2009	DBLP DOI BibTeX RDF	distance transform, Discrete mathematics, driver assistance, lane detection, stereo analysis
19	Jesús Gómez-Vilardebó, Ana I. Pérez-Neira	Bounds on Maximum Rate-Per-Energy for Orthogonal AWGN Multiple-Relay Channels.	IEEE Trans. Wirel. Commun.	2008	DBLP DOI BibTeX RDF
19	Yang Wang 0014, Hung Q. Ngo 0001, Xiaohong Jiang 0001	Strictly Nonblocking Function-Cast d-Ary Multi-Log Networks under Fanout and Crosstalk Constraints.	ICC	2008	DBLP DOI BibTeX RDF
19	Jarno Nousiainen, Jorma T. Virtamo, Pasi E. Lassila	Forwarding capacity of an infinite wireless network.	MSWiM	2008	DBLP DOI BibTeX RDF	forwarding capacity, wireless multihop networks, flow networks
19	David Tse	Information theory of wireless networks.	CISS	2008	DBLP DOI BibTeX RDF