Search results for "maximum-flow"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
11	Clyde L. Monma	The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions.	Oper. Res.	1979	DBLP DOI BibTeX RDF
11	Jeffrey B. Sidney	The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations.	Oper. Res.	1979	DBLP DOI BibTeX RDF
11	Alon Itai, Yossi Shiloach	Maximum Flow in Planar Networks.	SIAM J. Comput.	1979	DBLP DOI BibTeX RDF
11	James R. Evans	Maximum flow in probabilistic graphs-the discrete case.	Networks	1976	DBLP DOI BibTeX RDF
11	Peter Elias 0001, Amiel Feinstein, Claude E. Shannon	A note on the maximum flow through a network.	IRE Trans. Inf. Theory	1956	DBLP DOI BibTeX RDF
10	Kai Zeng 0001, Wenjing Lou, Hongqiang Zhai	Capacity of opportunistic routing in multi-rate and multi-hop wireless networks.	IEEE Trans. Wirel. Commun.	2008	DBLP DOI BibTeX RDF
10	Kai Zeng 0001, Wenjing Lou, Hongqiang Zhai	On End-to-End Throughput of Opportunistic Routing in Multirate and Multihop Wireless Networks.	INFOCOM	2008	DBLP DOI BibTeX RDF
10	Tomasz Radzik	Minimizing Capacity Violations in a Transshipment Network.	SODA	1992	DBLP BibTeX RDF
10	George Constantin Caragea, Uzi Vishkin	Brief announcement: better speedups for parallel max-flow.	SPAA	2011	DBLP DOI BibTeX RDF
10	Ran Duan, Seth Pettie	Fast algorithms for (max, min)-matrix multiplication and bottleneck shortest paths.	SODA	2009	DBLP DOI BibTeX RDF
10	Ali Saman Tosun	Multi-Site Retrieval of Declustered Data.	ICDCS	2008	DBLP DOI BibTeX RDF
10	Jonathan Bogdoll, Holger Hermanns, Lijun Zhang 0001	An Experimental Evaluation of Probabilistic Simulation.	FORTE	2008	DBLP DOI BibTeX RDF
10	Vladimir Kolmogorov, Yuri Boykov, Carsten Rother	Applications of parametric maxflow in computer vision.	ICCV	2007	DBLP DOI BibTeX RDF
10	Aditya Ramamoorthy, Jun Shi 0001, Richard D. Wesel	On the capacity of network coding for random networks.	IEEE Trans. Inf. Theory	2005	DBLP DOI BibTeX RDF
10	Lisa Fleischer	A fast approximation scheme for fractional covering problems with variable upper bounds.	SODA	2004	DBLP BibTeX RDF
10	Yuhua Liu, Shengsheng Yu, Jingzhong Mao, Peng Yang	Optimal Capacity Expansion Arc Algorithm on Networks.	CIS	2004	DBLP DOI BibTeX RDF
10	David R. Karger, Matthew S. Levine	Random sampling in residual graphs.	STOC	2002	DBLP DOI BibTeX RDF
10	H. Lin, Fabrizio Lombardi, Mi Lu	On the optimal reconfiguration of multipipeline arrays in the presence of faulty processing and switching elements.	IEEE Trans. Very Large Scale Integr. Syst.	1993	DBLP DOI BibTeX RDF
10	Pushmeet Kohli, Philip H. S. Torr	Effciently Solving Dynamic Markov Random Fields Using Graph Cuts.	ICCV	2005	DBLP DOI BibTeX RDF
10	Ewa Misiolek, Danny Z. Chen	Efficient Algorithms for Simplifying Flow Networks.	COCOON	2005	DBLP DOI BibTeX RDF
10	Daniel Sawitzki	Implicit Flow Maximization by Iterative Squaring.	SOFSEM	2004	DBLP DOI BibTeX RDF
10	Tom Bäckström, Paavo Alku, Erkki Vilkman	Time-domain parameterization of the closing phase of glottal airflow waveform from voices over a large intensity range.	IEEE Trans. Speech Audio Process.	2002	DBLP DOI BibTeX RDF
10	Yuri Boykov, Vladimir Kolmogorov	An Experimental Comparison of Min-cut/Max-flow Algorithms for Energy Minimization in Vision.	EMMCVPR	2001	DBLP DOI BibTeX RDF
10	Andrew V. Goldberg, Satish Rao	Beyond the Flow Decomposition Barrier.	J. ACM	1998	DBLP DOI BibTeX RDF	combinatorial optimization, maximum flows
10	S. Muthukrishnan 0001, Torsten Suel	Second-Order Methods for Distributed Approximate Single- and Multicommodity Flow.	RANDOM	1998	DBLP DOI BibTeX RDF
10	Dongsheng Wang 0012, Ernest S. Kuh	Performance-Driven Interconnect Global Routing.	Great Lakes Symposium on VLSI	1996	DBLP DOI BibTeX RDF
7	Yu-Liang Kuo, Chia-Cheng Hu, Chun-Yuan Chiu	Maximum Traffic Routing Problems in Wireless Mesh Networks.	PCM	2008	DBLP DOI BibTeX RDF
7	Aaron P. Hurst, Alan Mishchenko, Robert K. Brayton	Scalable min-register retiming under timing and initializability constraints.	DAC	2008	DBLP DOI BibTeX RDF	min-area, retiming, initial state, sequential optimization
7	Bastian Katz, Marco Gaertler, Dorothea Wagner	Maximum Rigid Components as Means for Direction-Based Localization in Sensor Networks.	SOFSEM (1)	2007	DBLP DOI BibTeX RDF
7	Jeff Hartline, Alexa Sharp	An Incremental Model for Combinatorial Maximization Problems.	WEA	2006	DBLP DOI BibTeX RDF	online problems, analysis of algorithms, network analysis, combinatorial problems, approximation techniques
7	Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirrokni	Limitations of cross-monotonic cost sharing schemes.	SODA	2005	DBLP BibTeX RDF
7	Dinesh Garg, Kamal Jain, Kunal Talwar, Vijay V. Vazirani	A Primal-Dual Algorithm for Computing Fisher Equilibrium in the Absence of Gross Substitutability Property.	WINE	2005	DBLP DOI BibTeX RDF
7	Hyunseung Choo, Vladimir V. Shakhov	Routing and Wavelength Assignments in Optical WDM Networks with Maximum Quantity of Edge Disjoint Paths.	International Conference on Computational Science	2004	DBLP DOI BibTeX RDF
7	Edgar Knapp	An Exercise in the Formal Derivation of Parallel Programs: Maximum Flows in Graphs.	ACM Trans. Program. Lang. Syst.	1990	DBLP DOI BibTeX RDF
7	Fabrizio Lombardi, Mariagiovanna Sami, Renato Stefanelli	Reconfiguration of VLSI arrays by covering.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1989	DBLP DOI BibTeX RDF
7	Friedrich Eisenbrand, Andreas Karrenbauer, Martin Skutella, Chihao Xu	Multiline Addressing by Network Flow.	Algorithmica	2009	DBLP DOI BibTeX RDF	Combinatorial optimization, Network design, Matrix decomposition, Algorithm engineering, OLED
7	Andrew Delong, Yuri Boykov	A Scalable graph-cut algorithm for N-D grids.	CVPR	2008	DBLP DOI BibTeX RDF
7	Angelo Oddi, Nicola Policella	Improving Robustness of Spacecraft Downlink Schedules.	IEEE Trans. Syst. Man Cybern. Part C	2007	DBLP DOI BibTeX RDF
7	Yinying Yang, Mihaela Cardei	Movement-assisted sensor redeployment scheme for network lifetime increase.	MSWiM	2007	DBLP DOI BibTeX RDF	sensor mobility, wireless sensor networks, coverage, network lifetime, sensor deployment
7	Xiaodong Wu 0001	Efficient Algorithms for the Optimal-Ratio Region Detection Problems in Discrete Geometry with Applications.	ISAAC	2006	DBLP DOI BibTeX RDF
7	Friedrich Eisenbrand, Andreas Karrenbauer, Martin Skutella, Chihao Xu	Multiline Addressing by Network Flow.	ESA	2006	DBLP DOI BibTeX RDF
7	Brian C. Dean, Michel X. Goemans, Nicole Immorlica	Finite Termination of "Augmenting Path" Algorithms in the Presence of Irrational Problem Data.	ESA	2006	DBLP DOI BibTeX RDF
7	Jaeseok Choi, Timothy D. Mount, Robert J. Thomas	Transmission System Expansion Plans in View Point of Deterministic, Probabilistic and Security Reliability Criteria.	HICSS	2006	DBLP DOI BibTeX RDF
7	Daniel Sawitzki	Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms.	LATIN	2006	DBLP DOI BibTeX RDF
7	Bo Hong, Viktor K. Prasanna	Bandwidth-Aware Resource Allocation for Heterogeneous Computing Systems to Maximize Throughput.	ICPP	2003	DBLP DOI BibTeX RDF
7	Pablo Molinero-Fernández, Nick McKeown	The performance of circuit switching in the internet.	Comput. Commun. Rev.	2002	DBLP DOI BibTeX RDF
7	Jack Edmonds 0001, Richard M. Karp	Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems.	Combinatorial Optimization	2001	DBLP DOI BibTeX RDF
7	Kengo R. Azegami, Atsushi Takahashi 0001, Y. Kajitan	Enumerating the min-cuts for applications to graph extraction under size constraints.	ISCAS (6)	1999	DBLP DOI BibTeX RDF
7	Zvi Galil, Éva Tardos	An O(n²(m + n log n)log n) min-cost flow algorithm.	J. ACM	1988	DBLP DOI BibTeX RDF
5	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
5	Xu He, Sheqin Dong, Xianlong Hong, Satoshi Goto	Integrated interlayer via planning and pin assignment for 3D ICs.	SLIP	2009	DBLP DOI BibTeX RDF
5	Qi Song, Xiaodong Wu 0001, Yunlong Liu, Mark Smith 0005, John M. Buatti, Milan Sonka	Optimal Graph Search Segmentation Using Arc-Weighted Graph for Simultaneous Surface Detection of Bladder and Prostate.	MICCAI (1)	2009	DBLP DOI BibTeX RDF
5	Wojciech Jawor, Marek Chrobak, Christoph Dürr	Competitive Analysis of Scheduling Algorithms for Aggregated Links.	Algorithmica	2008	DBLP DOI BibTeX RDF	Scheduling, Online algorithms
5	Jérôme Darbon	Global Optimization for First Order Markov Random Fields with Submodular Priors.	IWCIA	2008	DBLP DOI BibTeX RDF
5	Jia-Wei Fang, Yao-Wen Chang	Area-I/O flip-chip routing for chip-package co-design.	ICCAD	2008	DBLP DOI BibTeX RDF
5	Frank Neumann 0001, Joachim Reichel, Martin Skutella	Computing minimum cuts by randomized search heuristics.	GECCO	2008	DBLP DOI BibTeX RDF	minimum s-t-cuts, evolutionary algorithms, multi-objective optimization, randomized search heuristics
5	Tian Lan, Xiaojun Lin, Mung Chiang, Ruby B. Lee	How Bad is Suboptimal Rate Allocation?	INFOCOM	2008	DBLP DOI BibTeX RDF
5	Pushmeet Kohli, Alexander Shekhovtsov, Carsten Rother, Vladimir Kolmogorov, Philip H. S. Torr	On partial optimality in multi-label MRFs.	ICML	2008	DBLP DOI BibTeX RDF
5	Sriram Chellappan, Xiaole Bai, Bin Ma 0002, Dong Xuan, Changqing Xu	Mobility Limited Flip-Based Sensor Networks Deployment.	IEEE Trans. Parallel Distributed Syst.	2007	DBLP DOI BibTeX RDF	Sensor networks deployment, limited mobility, flip-based sensors
5	Jonathan S. K. Chan, Victor O. K. Li, King-Shan Lui	Performance comparison of scheduling algorithms for peer-to-peer collaborative file distribution.	IEEE J. Sel. Areas Commun.	2007	DBLP DOI BibTeX RDF
5	Stephen Kloder, Seth Hutchinson 0001	Barrier Coverage for Variable Bounded-Range Line-of-Sight Guards.	ICRA	2007	DBLP DOI BibTeX RDF
5	Lijun Zhang 0001, Holger Hermanns, Friedrich Eisenbrand, David N. Jansen	Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations.	TACAS	2007	DBLP DOI BibTeX RDF
5	Masateru Furusato, Tomohiro Shima, Yuma Kokuzawa, Kazuhiko Ito, Takashi Tanaka, Kiyotaka Iwasaki, Yi Qian 0002, Mitsuo Umezu, Zhikun Yan, Ling Zhu	A Reproduction of Inflow Restriction in the Mock Circulatory System to Evaluate a Hydrodynamic Performance of a Ventricular Assist Device in Practical Conditions.	LSMS (2)	2007	DBLP DOI BibTeX RDF
5	Maiko Shigeno	Maximum network flows with concave gains.	Math. Program.	2006	DBLP DOI BibTeX RDF	Flow algorithms, Nonlinear optimization, Generalized networks
5	Tomasz Gierszewski, Wojciech Molisz, Jacek Rak	On Certain Behavior of Scale-Free Networks Under Malicious Attacks.	SAFECOMP	2006	DBLP DOI BibTeX RDF
5	Toshihiro Takahashi, Hideyuki Mizuta	Efficient agent-based simulation framework for multi-node supercomputers.	WSC	2006	DBLP DOI BibTeX RDF
5	Ying Liu 0042, Xin Chen 0001, Chengcui Zhang, Alan P. Sprague	An Interactive Region-Based Image Clustering and Retrieval Platform.	ICME	2006	DBLP DOI BibTeX RDF
5	Herbert Bay, Andreas Ess, Alexander Neubeck, Luc Van Gool	3D from Line Segments in Two Poorly-Textured, Uncalibrated Images.	3DPVT	2006	DBLP DOI BibTeX RDF
5	Diah Chaerani, Cornelis Roos	Modelling Some Robust Design Problems via Conic Optimization.	OR	2006	DBLP DOI BibTeX RDF
5	Wojciech Jawor, Marek Chrobak, Christoph Dürr	Competitive Analysis of Scheduling Algorithms for Aggregated Links.	LATIN	2006	DBLP DOI BibTeX RDF
5	Hung-Ming Chen, Li-Da Huang, I-Min Liu, Martin D. F. Wong	Simultaneous power supply planning and noise avoidance in floorplan design.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2005	DBLP DOI BibTeX RDF
5	Cartic Ramakrishnan, William H. Milnor, Matthew Perry, Amit P. Sheth	Discovering informative connection subgraphs in multi-relational graphs.	SIGKDD Explor.	2005	DBLP DOI BibTeX RDF	multi-relational graphs, semantic pattern discovery in RDF graphs, subgraph discovery
5	Paul G. Spirakis	Keynote Talk Summary: Algorithmic Aspects of Sensor Networks.	WAC	2005	DBLP DOI BibTeX RDF
5	Ying Zhu 0007, Baochun Li	Overlay Networks with Linear Capacity Constraints.	IWQoS	2005	DBLP DOI BibTeX RDF
5	Pierre Senellart	Identifying Websites with Flow Simulation.	ICWE	2005	DBLP DOI BibTeX RDF
5	Adrian Barbu, Song Chun Zhu	Graph Partition by Swendsen-Wang Cuts.	ICCV	2003	DBLP DOI BibTeX RDF
5	Karl Hendling, Brikena Statovci-Halimi, Gerald Franzl, Artan Halimi	A New Bandwidth Guaranteed Routing Approach for Online Calculation of LSPs for MPLS Traffic Engineering.	MMNS	2003	DBLP DOI BibTeX RDF
5	Harold N. Gabow	Better performance bounds for finding the smallest k-edge connected spanning subgraph of a multigraph.	SODA	2003	DBLP BibTeX RDF
5	Roy Kucukates, Cem Ersoy	High Performance Routing in a LEO Satellite Network.	ISCC	2003	DBLP DOI BibTeX RDF
5	A. S. Nepomniaschaya	Associative Parallel Algorithms for Computing Functions Defined on Paths in Trees.	PARELEC	2002	DBLP DOI BibTeX RDF
5	Huaibin Zhao	Global Optimal Surface from Stereo.	ICPR	2000	DBLP DOI BibTeX RDF
5	Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting	A Faster Algorithm for Finding Disjoint Paths in Grids.	ISAAC	1999	DBLP DOI BibTeX RDF
5	Hiroshi Nagamochi, Toshihide Ibaraki	A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts.	IPCO	1999	DBLP DOI BibTeX RDF
5	Hiroshi Nagamochi, Shigeki Katayama, Toshihide Ibaraki	A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs.	COCOON	1999	DBLP DOI BibTeX RDF
5	Hiroshi Ishikawa 0002, Davi Geiger	Occlusions, Discontinuities, and Epipolar Lines in Stereo.	ECCV (1)	1998	DBLP DOI BibTeX RDF
5	Cheol-Hoon Lee, Kang G. Shin	Optimal Task Assignment in Homogeneous Networks.	IEEE Trans. Parallel Distributed Syst.	1997	DBLP DOI BibTeX RDF	Array and tree networks, homogeneous networks, network flow, task assignment, maximum flows, cutsets
5	Zhigang Qin, Tetiana Lo, Felix F. Wu	The Optimal Virtual Path Design of ATM Networks.	LCN	1997	DBLP DOI BibTeX RDF	ATM, Virtual path
5	L. James Hwang, Abbas El Gamal	Min-cut replication in partitioned networks.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1995	DBLP DOI BibTeX RDF
5	Hiroshi Nagamochi, Toshihide Ibaraki	A Faster Edge Splitting Algorithm in Multigraphs and its Application to the Edge-Connectivity Augmentation Problem.	IPCO	1995	DBLP DOI BibTeX RDF
5	Hiroshi Nagamochi, Kazuhiro Nishimura, Toshihide Ibaraki	Computing All Small Cuts in Undirected Networks.	ISAAC	1994	DBLP DOI BibTeX RDF
5	Esteban Feuerstein, Alberto Marchetti-Spaccamela	Dynamic Algorithms for Shortest Paths in Planar Graphs.	WG	1991	DBLP DOI BibTeX RDF
5	James R. Yee	On Bounding Distributions For Stochastic Networks.	ACM Annual Conference (1)	1978	DBLP DOI BibTeX RDF	PERT