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

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	Yuanning Li, YongHong Tian, Jingjing Yang, Ling-Yu Duan, Wen Gao	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
2	Xue-Bin Liang	Matrix games in the multicast networks: maximum information flows with network switching.	IEEE Transactions on Information 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
2	Xijin Yan, Jun Yang, Zhen Zhang	An outer bound for multisource multisink network coding with minimum cost consideration.	IEEE Transactions on Information 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
2	José M. Bioucas-Dias, Gonçalo Valadão	Phase unwrapping: a new max-flow/min-cut based approach.	ICIP	2005	DBLP DOI BibTeX RDF
2	Bertrand Guenin	A Short Proof of Seymour's Characterization of the Matroids with the Max-Flow Min-Cut Property.	IPCO	2002	DBLP BibTeX RDF
2	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
2	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
1	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
1	S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari	A Max-Flow/Min-Cut Algorithm for Linear Deterministic Relay Networks.	IEEE Transactions on Information Theory	2011	DBLP DOI BibTeX RDF
1	Maximilien Gadouleau, Søren Riis	Max-flow min-cut theorem for Rényi entropy in communication networks.	ISIT	2011	DBLP DOI BibTeX RDF
1	Ananda S. Chowdhury, Suchendra M. Bhandarkar, Robert W. Robinson, Jack C. Yu, Tianming Liu	Detection of hairline mandibular fracture using max-flow min-cut and Kolmogorov-Smirnov distance.	ISBI	2011	DBLP DOI BibTeX RDF
1	José Martínez-Bernal, Edwin O'Shea, Rafael H. Villarreal	Ehrhart Clutters: Regularity and Max-Flow Min-Cut.	Electr. J. Comb.	2010	DBLP BibTeX RDF
1	Maximilien Gadouleau, Søren Riis	Max-Flow Min-Cut Theorems for Communication Networks Based on Equational Logic	CoRR	2010	DBLP BibTeX RDF
1	S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari	A Max-Flow/Min-Cut Algorithm for a Class of Wireless Networks.	SODA	2010	DBLP BibTeX RDF
1	Antonin Chambolle, Jérôme Darbon	On Total Variation Minimization and Surface Evolution Using Parametric Maximum Flows.	International Journal of Computer Vision	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
1	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
1	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
1	Hanife Kebapci, Berrin A. Yanikoglu, Gozde B. Unal	Plant image retrieval using color and texture features.	ISCIS	2009	DBLP DOI BibTeX RDF
1	Jose Joaquin Garcia-Luna-Aceves, Zheng Wang, Hamid R. Sadjadpour, Shirish S. Karande	Optimal Unicast Capacity of Random Geometric Graphs: Impact of Multipacket Transmission and Reception.	IEEE Journal on Selected Areas in Communications	2009	DBLP DOI BibTeX RDF
1	Aitor del Coso, Christian Ibars	Achievable rates for the AWGN channel with multiple parallel relays.	IEEE Transactions on Wireless Communications	2009	DBLP DOI BibTeX RDF
1	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
1	M. Hachimori, M. Nakamura	The max-flow min-cut property of two-dimensional affine convex geometries.	Discrete Mathematics	2008	DBLP DOI BibTeX RDF
1	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
1	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
1	David Tse	Information theory of wireless networks.	CISS	2008	DBLP DOI BibTeX RDF
1	Andrew Delong, Yuri Boykov	A Scalable graph-cut algorithm for N-D grids.	CVPR	2008	DBLP DOI BibTeX RDF
1	Yang Wang 0014, Hung Q. Ngo, Xiaohong Jiang	Strictly Nonblocking Function-Cast d-Ary Multi-Log Networks under Fanout and Crosstalk Constraints.	ICC	2008	DBLP DOI BibTeX RDF
1	Debdeep Chatterjee, Tan F. Wong, Tat M. Lok	Cooperative Transmission in a Wireless Cluster Based on Flow Management.	WCNC	2008	DBLP DOI BibTeX RDF
1	Jesús Gómez-Vilardebó, Ana I. Pérez-Neira	Bounds on Maximum Rate-Per-Energy for Orthogonal AWGN Multiple-Relay Channels.	IEEE Transactions on Wireless Communications	2008	DBLP DOI BibTeX RDF
1	Maren Martens, S. Thomas McCormick	A Polynomial Algorithm for Weighted Abstract Flow.	IPCO	2008	DBLP DOI BibTeX RDF
1	J. J. Garcia-Luna-Aceves, Hamid R. Sadjadpour, Zheng Wang	Challenges: towards truly scalable ad hoc networks.	MOBICOM	2007	DBLP DOI BibTeX RDF	multicast capacity, unicast capacity, ad hoc networks, network coding, multihop wireless networks, multipacket reception
1	Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman	Single source multiroute flows and cuts on uniform capacity networks.	SODA	2007	DBLP DOI BibTeX RDF
1	Olivier Juan, Yuri Boykov	Capacity Scaling for Graph Cuts in Vision.	ICCV	2007	DBLP DOI BibTeX RDF
1	Erik Stauffer, Ozgur Oyman, Ravi Narasimhan, Arogyaswami Paulraj	Finite-SNR diversity-multiplexing tradeoffs in fading relay channels.	IEEE Journal on Selected Areas in Communications	2007	DBLP DOI BibTeX RDF
1	José M. Bioucas-Dias, Gonçalo Valadão	Phase Unwrapping via Graph Cuts.	IEEE Transactions on Image Processing	2007	DBLP DOI BibTeX RDF
1	James R. Lee, Prasad Raghavendra	Coarse Differentiation and Multi-flows in Planar Graphs.	APPROX-RANDOM	2007	DBLP DOI BibTeX RDF
1	Jian Guan, Guoping Qiu	Modeling User Feedback Using a Hierarchical Graphical Model for Interactive Image Retrieval.	PCM	2007	DBLP DOI BibTeX RDF	image segmentation, Image retrieval, relevance feedback, semi-supervised learning, graphical model
1	Mohammad Taghi Hajiaghayi, Tom Leighton	On the max-flow min-cut ratio for directed multicommodity flows.	Theor. Comput. Sci.	2006	DBLP DOI BibTeX RDF
1	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
1	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 Transactions on Information 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
1	Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor	A general approach to online network optimization problems.	ACM Transactions on Algorithms	2006	DBLP DOI BibTeX RDF	Online network optimization, group Steiner, multi-cuts, competitive analysis, facility location, randomized rounding
1	Mala L. Radhakrishnan, Sara L. Su	Dead-End Elimination as a Heuristic for Min-Cut Image Segmentation.	ICIP	2006	DBLP DOI BibTeX RDF
1	Shraga I. Bross	A Converse Result for the Discrete Memoryless Relay Channel With Relay-Transmitter Feedback.	IEEE Transactions on Information Theory	2006	DBLP DOI BibTeX RDF
1	Amir F. Dana, Radhika Gowaikar, R. Palanki, Babak Hassibi, Michelle Effros	Capacity of wireless erasure networks.	IEEE Transactions on Information Theory	2006	DBLP DOI BibTeX RDF
1	Abbas El Gamal, M. Mohseni, Sina Zahedi	Bounds on capacity and minimum energy-per-bit for AWGN relay channels.	IEEE Transactions on Information Theory	2006	DBLP DOI BibTeX RDF
1	Kazuo Iwama	Classic and Quantum Network Coding.	SWAT	2006	DBLP DOI BibTeX RDF
1	Songqiao Han, Shensheng Zhang, Yong Zhang	A Generic Software Partitioning Algorithm for Pervasive Computing.	WASA	2006	DBLP DOI BibTeX RDF	Algorithm, Pervasive computing, Software partitioning
1	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
1	Abbas El Gamal, Sina Zahedi	Capacity of a class of relay channels with orthogonal components.	IEEE Transactions on Information Theory	2005	DBLP DOI BibTeX RDF
1	Sidharth Jaggi, Peter Sanders, Philip A. Chou, Michelle Effros, Sebastian Egner, Kamal Jain, Ludo M. G. M. Tolhuizen	Polynomial time algorithms for multicast network code construction.	IEEE Transactions on Information Theory	2005	DBLP DOI BibTeX RDF
1	Yingbin Liang, Venugopal V. Veeravalli	Gaussian Orthogonal Relay Channels: Optimal Resource Allocation and Capacity.	IEEE Transactions on Information Theory	2005	DBLP DOI BibTeX RDF
1	Rupesh S. Shelar, Sachin S. Sapatnekar	BDD decomposition for delay oriented pass transistor logic synthesis.	IEEE Trans. VLSI Syst.	2005	DBLP DOI BibTeX RDF
1	José M. Bioucas-Dias, Gonçalo Valadão	Phase Unwrapping via Graph Cuts.	IbPRIA	2005	DBLP DOI BibTeX RDF
1	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
1	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
1	Christina Peraki, Sergio D. Servetto	On the maximum stable throughput problem in random networks with directional antennas.	MobiHoc	2003	DBLP DOI BibTeX RDF	maximum stable throughput, wireless networks, network flow, random graphs, directional antennas, multicommodity flow, random networks
1	Peter Sanders, 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
1	Jittat Fakcharoenphol, Kunal Talwar	An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor.	RANDOM-APPROX	2003	DBLP DOI BibTeX RDF
1	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
1	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
1	Elliot Anshelevich, David Kempe, Jon M. Kleinberg	Stability of load balancing algorithms in dynamic adversarial systems.	STOC	2002	DBLP DOI BibTeX RDF
1	Naveen Garg, Rohit Khandekar	Fast Approximation Algorithms for Fractional Steiner Forest and Related Problems.	FOCS	2002	DBLP DOI BibTeX RDF
1	Rupesh S. Shelar, Sachin S. Sapatnekar	An Efficient Algorithm for Low Power Pass Transistor Logic Synthesis.	VLSI Design	2002	DBLP DOI BibTeX RDF	Low Power, Logic Synthesis, Pass Transistor Logic
1	Ishai Menache, Shie Mannor, Nahum Shimkin	Q-Cut - Dynamic Discovery of Sub-goals in Reinforcement Learning.	ECML	2002	DBLP DOI BibTeX RDF
1	Phil Diamond	A fuzzy max-flow min-cut theorem.	Fuzzy Sets and Systems	2001	DBLP DOI BibTeX RDF
1	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
1	Huiqun Liu, Martin D. F. Wong	Network-flow-based multiway partitioning with area and pin constraints.	IEEE Trans. on CAD of Integrated Circuits and Systems	1998	DBLP DOI BibTeX RDF
1	Manfred Padberg, Ting-Yi Sung	An analytic symmetrization of max flow-min cut.	Discrete Mathematics	1997	DBLP DOI BibTeX RDF
1	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
1	Hannah Honghua Yang, Martin D. F. Wong	Balanced partitioning.	IEEE Trans. on CAD of Integrated Circuits and Systems	1996	DBLP DOI BibTeX RDF
1	Philip N. Klein, Satish Rao, Ajit Agrawal, R. Ravi	An Approximate Max-Flow Min-Cut Relation for Unidirected Multicommodity Flow, with Applications.	Combinatorica	1995	DBLP DOI BibTeX RDF
1	Serge A. Plotkin, Éva Tardos	Improved Bounds on the Max-Flow Min-Cut Ratio for Multicommodity Flows.	Combinatorica	1995	DBLP DOI BibTeX RDF
1	Honghua Yang, D. F. Wong	Efficient network flow based min-cut balanced partitioning.	ICCAD	1994	DBLP DOI BibTeX RDF
1	Serge A. Plotkin, Éva Tardos	Improved bounds on the max-flow min-cut ratio for multicommodity flows.	STOC	1993	DBLP DOI BibTeX RDF
1	Philip N. Klein, Ajit Agrawal, R. Ravi, Satish Rao	Approximation through Multicommodity Flow	FOCS	1990	DBLP DOI BibTeX RDF	minimum deletion, max-flow-min-cut theorem, approximation algorithms, multicommodity flow
1	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
1	Paul D. Seymour	The matroids with the max-flow min-cut property.	J. Comb. Theory, Ser. B	1977	DBLP DOI BibTeX RDF