Search results for "Maximum flow"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Min Xie, Lixin Gao, Haiwa Guan	Ant Algorithm Applied in the Minimal Cost Maximum Flow Problem.	ICIC	2008	DBLP DOI BibTeX RDF	minimal cost maximum flow problem, ant algorithm, directed network
3	Douglas S. Altner, Özlem Ergun	Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts.	CPAIOR	2008	DBLP DOI BibTeX RDF	Reoptimization, Robust Minimum Cut, Maximum Flow
3	Maria Grazia Scutellà	A note on the parametric maximum flow problem and some related reoptimization issues.	Annals OR	2007	DBLP DOI BibTeX RDF	Parametric arc capacity, Maximum flow
3	Aaron P. Hurst, Alan Mishchenko, Robert K. Brayton	Fast Minimum-Register Retiming via Binary Maximum-Flow.	FMCAD	2007	DBLP DOI BibTeX RDF	Sequential Verification, Retiming, Maximum Flow, State Minimization
3	Longcheng Liu, Jianzhong Zhang 0001	Inverse maximum flow problems under the weighted Hamming distance.	J. Comb. Optim.	2006	DBLP DOI BibTeX RDF	Inverse problems, Hamming distance, Maximum flow, Strongly polynomial algorithms
3	Noriko Imafuji, Masaru Kitsuregawa	Effects of maximum flow algorithm on identifying web community.	WIDM	2002	DBLP DOI BibTeX RDF	maximum-flow algorithm, web graph, web community
3	Sébastien Roy	Stereo Without Epipolar Lines: A Maximum-Flow Formulation.	International Journal of Computer Vision	1999	DBLP DOI BibTeX RDF	maximum-flow, stereo correspondence, multiple cameras, 3-d reconstruction, range estimation
3	Sukumar Ghosh, Arobinda Gupta, Sriram V. Pemmaraju	A Self-Stabilizing Algorithm for the Maximum Flow Problem.	Distributed Computing	1997	DBLP DOI BibTeX RDF	Fault-tolerance, Distributed algorithms, Self-stabilization, Maximum flow
3	Joseph Cheriyan, Torben Hagerup	A Randomized Maximum-Flow Algorithm	FOCS	1989	DBLP DOI BibTeX RDF	dynamic trees data structure, randomized maximum-flow algorithm, prudent linking excess diminishing, negligible probability, maximum flow excess, PLED algorithm, parameter, worst case, vertex
2	Michel Minoux	On robust maximum flow with polyhedral uncertainty sets.	Optimization Letters	2009	DBLP DOI BibTeX RDF
2	Mateo Restrepo, David P. Williamson	A simple GAP-canceling algorithm for the generalized maximum flow problem.	Math. Program.	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 68Q25, 05C85, 90C35, 90B10
2	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
2	Franz-Josef Brandenburg, Mao-cheng Cai	Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains.	FAW	2009	DBLP DOI BibTeX RDF	extended networks, lossy and gainy arcs, max-flow, unit-loss networks, shortest path, NP-hard
2	Haim Kaplan, Yahav Nussbaum	Maximum Flow in Directed Planar Graphs with Vertex Capacities.	ESA	2009	DBLP DOI BibTeX RDF
2	Andrew V. Goldberg	Two-Level Push-Relabel Algorithm for the Maximum Flow Problem.	AAIM	2009	DBLP DOI BibTeX RDF
2	Bao-Hong Shen, Shuiwang Ji, Jieping Ye	Mining discrete patterns via binary matrix factorization.	KDD	2009	DBLP DOI BibTeX RDF	binary matrix factorization, rank-one, regularization, integer linear program, maximum flow, minimum cut
2	Andrew V. Goldberg	The Partial Augment-Relabel Algorithm for the Maximum Flow Problem.	ESA	2008	DBLP DOI BibTeX RDF
2	Bo Hong	A lock-free multi-threaded algorithm for the maximum flow problem.	IPDPS	2008	DBLP DOI BibTeX RDF
2	Hans L. Bodlaender, Richard B. Tan, Thomas C. van Dijk, Jan van Leeuwen	Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint.	SWAT	2008	DBLP DOI BibTeX RDF
2	Hongzheng Wang, Pingyi Fan, Khaled Ben Letaief	Maximum flow and network capacity of network coding for ad-hoc networks.	IEEE Transactions on Wireless Communications	2007	DBLP DOI BibTeX RDF
2	Xiaoxia Huang, Jianfeng Wang, Yuguang Fang	Maximum flow problem in wireless ad hoc networks with directional antennas.	Optimization Letters	2007	DBLP DOI BibTeX RDF
2	Jonatan Schroeder, Elias Procópio Duarte Jr.	Fault-Tolerant Dynamic Routing Based on Maximum Flow Evaluation.	LADC	2007	DBLP DOI BibTeX RDF
2	Fábio Hernandes, Maria Teresa Lamata, Marcia Tomie Takahashi, Akebo Yamakami, José L. Verdegay	An Algorithm for the Fuzzy Maximum Flow Problem.	FUZZ-IEEE	2007	DBLP DOI BibTeX RDF
2	Pushmeet Kohli, Philip H. S. Torr	Dynamic Graph Cuts for Efficient Inference in Markov Random Fields.	IEEE Trans. Pattern Anal. Mach. Intell.	2007	DBLP DOI BibTeX RDF	Dynamic graph cuts, st-mincut, Markov Random Fields, Energy Minimization, Video segmentation, Maximum flow
2	Jong-Hyuk Lee, Sung-Ho Chin, Hwa-Min Lee, TaeMyoung Yoon, Kwang-Sik Chung, Heon-Chang Yu	Adaptive Workflow Scheduling Strategy in Service-Based Grids.	GPC	2007	DBLP DOI BibTeX RDF	adaptive grid scheduling, workflow, maximum flow
2	Ning Zhang, Ling Guan	Graph Cuts in Content-Based Image Classification and Retrieval with Relevance Feedback.	PCM	2007	DBLP DOI BibTeX RDF	Maximum-flow/minimum-cut, Relevance Feedback, Content-based Image Retrieval, Radial Basis Function, Graph Cuts
2	Xiaoyu Ji, Lixing Yang, Zhen Shao	Chance Constrained Maximum Flow Problem with Fuzzy Arc Capacities.	ICIC	2006	DBLP DOI BibTeX RDF
2	Mateo Restrepo, David P. Williamson	A simple GAP-canceling algorithm for the generalized maximum flow problem.	SODA	2006	DBLP DOI BibTeX RDF
2	Jingling Xue, Jens Knoop	A Fresh Look at PRE as a Maximum Flow Problem.	CC	2006	DBLP DOI BibTeX RDF
2	Thuy Lien Pham, Marc Bui, Ivan Lavallée, Si Hoàng Do	A Distributed Preflow-Push for the Maximum Flow Problem.	IICS	2005	DBLP DOI BibTeX RDF
2	Thuy Lien Pham, Ivan Lavallée, Marc Bui, Si Hoàng Do	A Distributed Algorithm for the Maximum Flow Problem.	ISPDC	2005	DBLP DOI BibTeX RDF
2	Sven Oliver Krumke, Willem de Paepe, Diana Poensgen, Maarten Lipmann, Alberto Marchetti-Spaccamela, Leen Stougie	On Minimizing the Maximum Flow Time in the Online Dial-a-Ride Problem.	WAOA	2005	DBLP DOI BibTeX RDF
2	Austin Armbruster, Michael R. Gosnell, Bruce M. McMillin, Mariesa L. Crow	Power Transmission Control Using Distributed Max Flow.	COMPSAC	2005	DBLP DOI BibTeX RDF	FT Algorithms, FT Communication, Fault Injection, maximum flow, power system
2	Ali Pinar, Bruce Hendrickson	Improving Load Balance with Flexibly Assignable Tasks.	IEEE Trans. Parallel Distrib. Syst.	2005	DBLP DOI BibTeX RDF	flexibly assignable tasks, constrained least squares, load balancing, Parallel computing, maximum flow
2	Ying Liu, Alan P. Sprague, Elliot Lefkowitz	Network flow for outlier detection.	ACM Southeast Regional Conference	2004	DBLP DOI BibTeX RDF	Maximum Flow Minimum Cut, data mining, graph theory, network flow, outlier detection
2	Noriko Imafuji, Masaru Kitsuregawa	Finding a Web Community by Maximum Flow Algorithm with HITS Score Based Capacity. (PDF / PS)	DASFAA	2003	DBLP DOI BibTeX RDF
2	Sven Oliver Krumke, Luigi Laura, Maarten Lipmann, Alberto Marchetti-Spaccamela, Willem de Paepe, Diana Poensgen, Leen Stougie	Non-abusiveness Helps: An O(1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem.	APPROX	2002	DBLP BibTeX RDF
2	Ali Pinar, Bruce Hendrickson	Exploiting flexibly assignable work to improve load balance.	SPAA	2002	DBLP DOI BibTeX RDF	algorithms, load balancing, parallel computing, least squares, maximum-flow
2	Thomas Erlebach, Torben Hagerup	Routing Flow Through a Strongly Connected Graph.	Algorithmica	2002	DBLP DOI BibTeX RDF	Feasible-flow problem, Strongly connected graph, Network flow, Analysis of algorithms, Depth-first search, Maximum-flow problem
2	Yoko Kamidoi, Shin'ichi Wakabayashi, Noriyoshi Yoshida	A Divide-and-Conquer Approach to the Minimum k-Way Cut Problem.	Algorithmica	2002	DBLP DOI BibTeX RDF	Minimum k -way cut, Maximum flow computation, Undirected weighted graph, Deterministic algorithm, Recursive structure
2	Timothy X. Brown, Harold N. Gabow, Qi Zhang	Maximum flow-life curve for a wireless ad hoc network.	MobiHoc	2001	DBLP DOI BibTeX RDF
2	Hans L. Bodlaender, Babette van Antwerpen-de Fluiter	Parallel Algorithms for Series Parallel Graphs and Graphs with Treewidth Two.	Algorithmica	2001	DBLP DOI BibTeX RDF	Minimum k -way cut, Maximum flow computation, Undirected weighted graph, Deterministic algorithm, Recursive structure
2	Lisa Fleischer	Universally Maximum Flow with Piecewise-Constant Capacities.	IPCO	1999	DBLP DOI BibTeX RDF
2	Andrew V. Goldberg	Recent Developments in Maximum Flow Algorithms (Invited Lecture).	SWAT	1998	DBLP DOI BibTeX RDF
2	Éva Tardos, Kevin D. Wayne	Simple Generalized Maximum Flow Algorithms.	IPCO	1998	DBLP DOI BibTeX RDF
2	Dorit S. Hochbaum	The Pseudoflow Algorithm and the Pseudoflow-Based Simplex for the Maximum Flow Problem.	IPCO	1998	DBLP DOI BibTeX RDF
2	Andrew V. Goldberg, Satish Rao	Beyond the Flow Decomposition Barrier.	FOCS	1997	DBLP DOI BibTeX RDF	flow decomposition barrier, arc lengths, Gomory-Hu tree problem, parametric flow problem, time bound, time bounds, combinatorial mathematics, maximum flow problem
2	Boris V. Cherkassky, Andrew V. Goldberg	On Implementing Push-Relabel Method for the Maximum Flow Problem.	IPCO	1995	DBLP DOI BibTeX RDF
2	Prathima Agrawal, Antony Ng	Computing Network Flow on a Multiple Processor Pipeline.	IEEE Trans. Parallel Distrib. Syst.	1994	DBLP DOI BibTeX RDF	multiple processor pipeline, Goldberg-Tarjan algorithm, network graph, six processors, distributed algorithms, graph theory, network flow, pipeline processing, parallel implementations, performance estimates, maximum flow, partitioned algorithm, message-passing multicomputer
2	Zhenyu Wu, Richard M. Leahy	An Optimal Graph Theoretic Approach to Data Clustering: Theory and Its Application to Image Segmentation.	IEEE Trans. Pattern Anal. Mach. Intell.	1993	DBLP DOI BibTeX RDF	optimal graph theoretic approach, undirected adjacency graph, arc capacities, mutually exclusive subgraphs, largest inter-subgraph maximum flow minimization, flow and cut equivalent tree partitioning, subgraph condensation, partially equivalent tree, region boundary location, closed edge contours, pattern recognition, image segmentation, image segmentation, graph theory, data clustering, minimax techniques
2	V. King, S. Rao, Robert Endre Tarjan	A Faster Deterministic Maximum Flow Algorithm.	SODA	1992	DBLP DOI BibTeX RDF
2	Joseph Cheriyan, Torben Hagerup, Kurt Mehlhorn	Can A Maximum Flow be Computed on o(nm) Time?	ICALP	1990	DBLP DOI BibTeX RDF
2	Andrew V. Goldberg, Robert Endre Tarjan	A new approach to the maximum-flow problem.	J. ACM	1988	DBLP DOI BibTeX RDF
2	Liwu Li, T. Anthony Marsland	A parallel algorithm for finding a maximum flow in 0-1 networks.	ACM Conference on Computer Science	1987	DBLP DOI BibTeX RDF	ASIC
2	Gregory F. Johnson, Janet A. Walz	A Maximum-Flow Approach to Anomaly Isolation in Unification-Based Incremental Type Inference.	POPL	1986	DBLP DOI BibTeX RDF
1	Paolo Serafini, Bruno Simeone	Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment.	Networks	2012	DBLP DOI BibTeX RDF
1	M. Gamst, B. Petersen	Comparing branch-and-price algorithms for the Multi-Commodity k-splittable Maximum Flow Problem.	European Journal of Operational Research	2012	DBLP DOI BibTeX RDF
1	Alireza Nazemi, Farahnaz Omidi	A capable neural network model for solving the maximum flow problem.	J. Computational Applied Mathematics	2012	DBLP DOI BibTeX RDF
1	Cenk Çaliskan	A computational study of the capacity scaling algorithm for the maximum flow problem.	Computers & OR	2012	DBLP DOI BibTeX RDF
1	Cenk Çaliskan	A faster polynomial algorithm for the constrained maximum flow problem.	Computers & OR	2012	DBLP DOI BibTeX RDF
1	Neeraj Kumar, Naveen Chilamkurti, Jong-Hyouk Lee	A novel minimum delay maximum flow multicast algorithm to construct a multicast tree in wireless mesh networks.	Computers & Mathematics with Applications	2012	DBLP DOI BibTeX RDF
1	Wenhua Li, Jinjiang Yuan	Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time.	Inf. Process. Lett.	2011	DBLP DOI BibTeX RDF
1	Camille Couprie, Leo J. Grady, Hugues Talbot, Laurent Najman	Combinatorial Continuous Maximum Flow.	SIAM J. Imaging Sciences	2011	DBLP DOI BibTeX RDF
1	Franz-Josef Brandenburg, Mao-cheng Cai	Shortest path and maximum flow problems in networks with additive losses and gains.	Theor. Comput. Sci.	2011	DBLP DOI BibTeX RDF
1	Haim Kaplan, Yahav Nussbaum	Maximum Flow in Directed Planar Graphs with Vertex Capacities.	Algorithmica	2011	DBLP DOI BibTeX RDF
1	Ibrahim Akgün, Barbaros Ç. Tansel, R. Kevin Wood	The multi-terminal maximum-flow network-interdiction problem.	European Journal of Operational Research	2011	DBLP DOI BibTeX RDF
1	Cenk Çaliskan	A specialized network simplex algorithm for the constrained maximum flow problem.	European Journal of Operational Research	2011	DBLP DOI BibTeX RDF
1	Yahuan Wei, Taoshen Li, Zhihui Ge	A Channel Assignment Algorithm for Wireless Mesh Networks Using the Maximum Flow Approach.	JNW	2011	DBLP DOI BibTeX RDF
1	Alessandro Bogliolo, Saverio Delpriori, Emanuele Lattanzi, Andrea Seraghiti	Self-adapting maximum flow routing for autonomous wireless sensor networks.	Cluster Computing	2011	DBLP DOI BibTeX RDF
1	Douglas S. Altner, Özlem Ergun	Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems.	Annals OR	2011	DBLP DOI BibTeX RDF
1	Philip N. Klein, Shay Mozes	Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameternlog(n)) Time	CoRR	2011	DBLP BibTeX RDF
1	Glencora Borradaile, Philip N. Klein, Shay Mozes, Yahav Nussbaum, Christian Wulff-Nilsen	Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time	CoRR	2011	DBLP BibTeX RDF
1	F. Liers, G. Pardella	Simplifying maximum flow computations: The effect of shrinking and good initial flows.	Discrete Applied Mathematics	2011	DBLP DOI BibTeX RDF
1	Cosmin Silvestru Negruseri, Mircea Bogdan Pacsosi, Barbara Stanley, Clifford Stein, Cristian George Strat	Solving maximum flow problems on real-world bipartite graphs.	ACM Journal of Experimental Algorithmics	2011	DBLP DOI BibTeX RDF
1	Katherine C. Hastings, Douglas R. Shier	Algebraic Methods for Stochastic Minimum Cut and Maximum Flow Problems.	INOC	2011	DBLP DOI BibTeX RDF
1	Ulrich Pferschy, Joachim Schauer	The Maximum Flow Problem with Conflict and Forcing Conditions.	INOC	2011	DBLP DOI BibTeX RDF
1	Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra	Maximum flow and minimum-cost flow in multi-interface networks.	ICUIMC	2011	DBLP DOI BibTeX RDF
1	Yanping Zhang, Bo Hua, Juan Jiang, Yuan Zhang, Xiaoyan Chen	Research on the Maximum Flow in Large-scale Network.	CIS	2011	DBLP DOI BibTeX RDF
1	Philip N. Klein, Shay Mozes	Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter · n log n) Time.	WADS	2011	DBLP DOI BibTeX RDF
1	Chen Zhou, Jin Peng	Models and Algorithm of Maximum Flow Problem in Uncertain Network.	AICI	2011	DBLP DOI BibTeX RDF
1	Felix Halim, Roland H. C. Yap, Yongzheng Wu	A MapReduce-Based Maximum-Flow Algorithm for Large Small-World Network Graphs.	ICDCS	2011	DBLP DOI BibTeX RDF
1	Li Wanqi, Nian Che, Jinlin Ren, Hongyue You	Histogram-Preserving Steganography Using Maximum Flow Algorithms.	ICDMA	2011	DBLP DOI BibTeX RDF
1	Dag Haugland, Mujahed Eleyat, Magnus Lie Hetland	The Maximum Flow Problem with Minimum Lot Sizes.	ICCL	2011	DBLP DOI BibTeX RDF
1	Glencora Borradaile, Philip N. Klein, Shay Mozes, Yahav Nussbaum, Christian Wulff-Nilsen	Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time.	FOCS	2011	DBLP DOI BibTeX RDF
1	Paul Christiano, Jonathan A. Kelner, Aleksander Madry, Daniel A. Spielman, Shang-Hua Teng	Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs.	STOC	2011	DBLP DOI BibTeX RDF
1	Changliang Zheng, Ren Ping Liu, Xun Yang, Iain B. Collings, Zheng Zhou, Eryk Dutkiewicz	Maximum Flow-Segment Based Channel Assignment and Routing in Cognitive Radio Networks.	VTC Spring	2011	DBLP DOI BibTeX RDF
1	George Constantin Caragea, Uzi Vishkin	Brief announcement: better speedups for parallel max-flow.	SPAA	2011	DBLP DOI BibTeX RDF
1	Douglas S. Altner, Özlem Ergun, Nelson A. Uhan	The Maximum Flow Network Interdiction Problem: Valid inequalities, integrality gaps, and approximability.	Oper. Res. Lett.	2010	DBLP DOI BibTeX RDF
1	Steffen Rebennack, Ashwin Arulselvan, Lily Elefteriadou, Panos M. Pardalos	Complexity analysis for maximum flow problems with arc reversals.	J. Comb. Optim.	2010	DBLP DOI BibTeX RDF
1	Chia-Cheng Hu, Yu-Liang Kuo, Chun-Yuan Chiu, Yueh-Min Huang	Maximum bandwidth routing and maximum flow routing in wireless mesh networks.	Telecommunication Systems	2010	DBLP DOI BibTeX RDF
1	Shay Mozes	Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in $O(n^{1.5} \log n)$ Time	CoRR	2010	DBLP BibTeX RDF
1	Barak Fishbain, Dorit S. Hochbaum, Stefan Mueller	Competitive Analysis of Minimum-Cut Maximum Flow Algorithms in Vision Problems	CoRR	2010	DBLP BibTeX RDF
1	Endre Csóka	Maximum flow is approximable by deterministic constant-time algorithm in sparse networks	CoRR	2010	DBLP BibTeX RDF
1	Glencora Borradaile, Christian Wulff-Nilsen	Multiple source, single sink maximum flow in a planar graph	CoRR	2010	DBLP BibTeX RDF
1	Philip N. Klein, Shay Mozes	Multiple-source single-sink maximum flow in directed planar graphs in $O(n^{1.5} \log n)$ time	CoRR	2010	DBLP BibTeX RDF
1	Paul Christiano, Jonathan A. Kelner, Aleksander Madry, Daniel A. Spielman, Shang-Hua Teng	Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs	CoRR	2010	DBLP BibTeX RDF
1	Yahav Nussbaum	Multiple-source multiple-sink maximum flow in planar graphs	CoRR	2010	DBLP BibTeX RDF
1	Cui-xia Xu	Research on the Maximum Flow Problem with Multiple Solutions.	DBTA	2010	DBLP DOI BibTeX RDF
1	Jannik Matuschke, Britta Peis	Lattices and Maximum Flow Algorithms in Planar Graphs.	WG	2010	DBLP DOI BibTeX RDF
1	Zhengyu He, Bo Hong	Dynamically tuned push-relabel algorithm for the maximum flow problem on CPU-GPU-Hybrid platforms.	IPDPS	2010	DBLP DOI BibTeX RDF