Search results for "min-cut"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
20	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
20	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
20	Maximilien Gadouleau, Søren Riis	Max-flow min-cut theorem for Rényi entropy in communication networks.	ISIT	2011	DBLP DOI BibTeX RDF
20	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
20	Tao Lin, Sheqin Dong, Song Chen 0001, Yuchun Ma, Ou He, Satoshi Goto	Novel and efficient min cut based voltage assignment in gate level.	ISQED	2011	DBLP DOI BibTeX RDF
20	Giuseppe F. Italiano, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen	Improved algorithms for min cut and max flow in undirected planar graphs.	STOC	2011	DBLP DOI BibTeX RDF
20	Raquel Fandos, Leyna Sadamori, Abdelhak M. Zoubir	High quality segmentation of synthetic aperture sonar images using the min-cut/max-flow algorithm.	EUSIPCO	2011	DBLP BibTeX RDF
20	Michel Minoux, Hacene Ouzia	Using DRL* relaxations for quadratically constrained pseudoboolean optimization: application to robust Min-Cut.	Electron. Notes Discret. Math.	2010	DBLP DOI BibTeX RDF
20	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
20	Junqiu Wang, Yasushi Yagi	Tracking and segmentation using min-cut with consecutive shape priors.	Paladyn J. Behav. Robotics	2010	DBLP DOI BibTeX RDF
20	Eduardo Corel, Florian Pitschi, Burkhard Morgenstern	A min-cut algorithm for the consistency problem in multiple sequence alignment.	Bioinform.	2010	DBLP DOI BibTeX RDF
20	Maximilien Gadouleau, Søren Riis	Max-Flow Min-Cut Theorems for Communication Networks Based on Equational Logic	CoRR	2010	DBLP BibTeX RDF
20	Ali Ridha Mahjoub, S. Thomas McCormick	Max Flow and Min Cut with bounded-length paths: complexity, algorithms, and approximation.	Math. Program.	2010	DBLP DOI BibTeX RDF
20	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
20	Lennart Gerdes, Mohit Thakur, Ralf Kötter	On the Dynamic Behavior of the Min-Cut in Random Geometric Graphs.	ICC	2010	DBLP DOI BibTeX RDF
20	Viet Quoc Pham, Keita Takahashi 0001, Takeshi Naemura	Bounding-Box Based Segmentation with Single Min-cut Using Distant Pixel Similarity.	ICPR	2010	DBLP DOI BibTeX RDF
20	Jing Yuan 0001, Egil Bae, Xue-Cheng Tai	A study on continuous max-flow and min-cut approaches.	CVPR	2010	DBLP DOI BibTeX RDF
20	Kanemitsu Ootsu, Takeshi Abe, Takashi Yokota, Takanobu Baba	Loop Performance Improvement for Min-cut Program Decomposition Method.	ICNC	2010	DBLP DOI BibTeX RDF
20	Moti Freiman, Achia Kronman, Steven J. Esses, Leo Joskowicz, Jacob Sosna	Non-parametric Iterative Model Constraint Graph min-cut for Automatic Kidney Segmentation.	MICCAI (3)	2010	DBLP DOI BibTeX RDF
20	Nicolas Duflot, Christophe Bérenguer, Laurence Dieulle, Dominique Vasseur	A min cut-set-wise truncation procedure for importance measures computation in probabilistic safety assessment.	Reliab. Eng. Syst. Saf.	2009	DBLP DOI BibTeX RDF
20	S. Shine, K. Murali Krishnan 0001	Extending Karger's randomized min-cut Algorithm for a Synchronous Distributed setting	CoRR	2009	DBLP BibTeX RDF
20	Christian Wulff-Nilsen	Minimum Cycle Basis and All-Pairs Min Cut of a Planar Graph in Subquadratic Time	CoRR	2009	DBLP BibTeX RDF
20	Aleksey Golovinskiy, Thomas A. Funkhouser	Min-cut based segmentation of point clouds.	ICCV Workshops	2009	DBLP DOI BibTeX RDF
20	Hannah Honghua Yang, Martin D. F. Wong	Circuit Partitioning: A Network-Flow-Based Balanced Min-Cut Approach.	Encyclopedia of Algorithms	2008	DBLP DOI BibTeX RDF
20	Yun Zeng, Dimitris Samaras, Wei Chen 0001, Qunsheng Peng 0001	Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images.	Comput. Vis. Image Underst.	2008	DBLP DOI BibTeX RDF
20	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
20	Masahiro Hachimori, M. Nakamura	The max-flow min-cut property of two-dimensional affine convex geometries.	Discret. Math.	2008	DBLP DOI BibTeX RDF
20	Hakan Topakkaya, Zhengdao Wang	Effects of delay and links between relays on the min-cut capacity in a wireless relay network.	Allerton	2008	DBLP DOI BibTeX RDF
20	Mohit Bansal, Claire Cardie, Lillian Lee	The Power of Negative Thinking: Exploiting Label Disagreement in the Min-cut Classification Framework.	COLING (Posters)	2008	DBLP BibTeX RDF
20	Oktay Günlük	A New Min-Cut Max-Flow Ratio for Multicommodity Flows.	SIAM J. Discret. Math.	2007	DBLP DOI BibTeX RDF
20	Michael Brinkmeier	A Simple and Fast Min-Cut Algorithm.	Theory Comput. Syst.	2007	DBLP DOI BibTeX RDF
20	Deepayan Chakrabarti, Christos Faloutsos, Yiping Zhan	Visualization of large networks with min-cut plots, A-plots and R-MAT.	Int. J. Hum. Comput. Stud.	2007	DBLP DOI BibTeX RDF
20	Mohammad Taghi Hajiaghayi, Tom Leighton	On the max-flow min-cut ratio for directed multicommodity flows.	Theor. Comput. Sci.	2006	DBLP DOI BibTeX RDF
20	Urs Niesen, Christina Fragouli, Daniela Tuninetti	Scaling Laws for Line Networks: From Zero-Error to Min-Cut Capacity.	ISIT	2006	DBLP DOI BibTeX RDF
20	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
20	Jarrod A. Roy, David A. Papa, Saurabh N. Adya, Hayward H. Chan, Aaron N. Ng, James F. Lu, Igor L. Markov	Capo: robust and scalable open-source min-cut floorplacer.	ISPD	2005	DBLP DOI BibTeX RDF	placement, physical design, floorplanning
20	Michael Brinkmeier	A Simple and Fast Min-cut Algorithm.	FCT	2005	DBLP DOI BibTeX RDF
20	Francisco J. Estrada, Allan D. Jepson, Chakra Chennubhotla 0001	Spectral Embedding and Min Cut for Image Segmentation.	BMVC	2004	DBLP DOI BibTeX RDF
20	Xianyang Jiang, Xubang Shen, Tianxu Zhang, Huayu Liu	An improved circuit-partitioning algorithm based on min-cut equivalence relation.	Integr.	2003	DBLP DOI BibTeX RDF
20	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
20	Phil Diamond	A fuzzy max-flow min-cut theorem.	Fuzzy Sets Syst.	2001	DBLP DOI BibTeX RDF
20	Wai-Kei Mak, D. F. Wong 0001	A fast hypergraph min-cut algorithm for circuit partitioning.	Integr.	2000	DBLP DOI BibTeX RDF
20	Srinivasa Rao Arikati, Kurt Mehlhorn	A Correctness Certificate for the Stoer-Wagner Min-Cut Algorithm.	Inf. Process. Lett.	1999	DBLP DOI BibTeX RDF
20	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
20	Dimitris Alevras	Small Min-Cut Polyhedra.	Math. Oper. Res.	1999	DBLP DOI BibTeX RDF
20	Srinivasa Rao Arikati, Shiva Chaudhuri, Christos D. Zaroliagis	All-Pairs Min-Cut in Sparse Networks.	J. Algorithms	1998	DBLP DOI BibTeX RDF
20	Yonatan Aumann, Yuval Rabani	An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm.	SIAM J. Comput.	1998	DBLP DOI BibTeX RDF
20	Manfred Padberg, Ting-Yi Sung	An analytic symmetrization of max flow-min cut.	Discret. Math.	1997	DBLP DOI BibTeX RDF
20	Youssef Saab	A Fast Clustering-Based Min-Cut Placement Algorithm With Simulated-Annealing Performance.	VLSI Design	1996	DBLP DOI BibTeX RDF
20	Spyros Tragoudas	Min-Cut Partitioning on Underlying Tree and Graph Structures.	IEEE Trans. Computers	1996	DBLP DOI BibTeX RDF	Circuit and network partitioning, NP-hard, iterative improvement
20	Raymond Lo, Sun Chan, James C. Dehnert, Ross A. Towle	Aggregate Operation Movement: A Min-Cut Approach to Global Code Motion.	Euro-Par, Vol. II	1996	DBLP DOI BibTeX RDF	global code motion, software pipelining, network flow, superscalar, minimum cut, global scheduling
20	Gavril Godza, Maurizio Rebaudengo, Matteo Sonza Reorda	Using Parallel Genetic Algorithms for Solving the Min-Cut Problem.	HPCN	1996	DBLP DOI BibTeX RDF
20	Serge A. Plotkin, Éva Tardos	Improved Bounds on the Max-Flow Min-Cut Ratio for Multicommodity Flows.	Comb.	1995	DBLP DOI BibTeX RDF
20	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
20	David Hartvigsen	Generalizing the all-pairs min cut problem.	Discret. Math.	1995	DBLP DOI BibTeX RDF
20	Katsunori Tani	A robust min-cut improvement algorithm based on dynamic look-ahead weighting.	ASP-DAC	1995	DBLP DOI BibTeX RDF
20	David Hartvigsen, Russell Mardon	The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs.	SIAM J. Discret. Math.	1994	DBLP DOI BibTeX RDF
20	Ryôhei Nozawa	Examples of max-flow and min-cut problems with duality gaps in continuous networks.	Math. Program.	1994	DBLP DOI BibTeX RDF
20	Mechthild Stoer, Frank Wagner 0001	A Simple Min Cut Algorithm.	ESA	1994	DBLP DOI BibTeX RDF
20	Roman Kuznar, Baldomir Zajc, Franc Brglez	A unified cost model for min-cut partitioning with replication applied to optimization of large heterogeneous FPGA partitions.	EURO-DAC	1994	DBLP DOI BibTeX RDF
20	Spyros Tragoudas	An improved algorithm for the generalized min-cut partitioning problem.	Great Lakes Symposium on VLSI	1994	DBLP DOI BibTeX RDF
20	Ellis L. Johnson, Anuj Mehrotra, George L. Nemhauser	Min-cut clustering.	Math. Program.	1993	DBLP DOI BibTeX RDF
20	Serge A. Plotkin, Éva Tardos	Improved bounds on the max-flow min-cut ratio for multicommodity flows.	STOC	1993	DBLP DOI BibTeX RDF
20	Monique Laurent, Antonio Sassano	A characterization of knapsacks with the max-flow- - min-cut property.	Oper. Res. Lett.	1992	DBLP DOI BibTeX RDF
20	L. James Hwang, Abbas El Gamal	Optimal replication for min-cut partitioning.	ICCAD	1992	DBLP DOI BibTeX RDF
20	Dan Bienstock	Some Generalized Max-Flow Min-Cut Problems in the Plane.	Math. Oper. Res.	1991	DBLP DOI BibTeX RDF
20	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
20	Burkhard Monien, Ivan Hal Sudborough	Min Cut is NP-Complete for Edge Weighted Treees.	Theor. Comput. Sci.	1988	DBLP DOI BibTeX RDF
20	Dwight D. Hill	Alternative strategies for applying min-cut to VLSI placement.	ICCD	1988	DBLP DOI BibTeX RDF
20	Shai Simonson	A Variation on the Min Cut Linear Arrangement Problem.	Math. Syst. Theory	1987	DBLP DOI BibTeX RDF
20	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
20	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
20	Mihalis Yannakakis	A Polynomial Algorithm for the Min-Cut Linear Arrangement of Trees	J. ACM	1985	DBLP DOI BibTeX RDF
20	Moon-Jung Chung, Fillia Makedon, Ivan Hal Sudborough, Jonathan S. Turner	Polynomial Time Algorithms for the Min Cut Problem on Degree Restricted Trees.	SIAM J. Comput.	1985	DBLP DOI BibTeX RDF
20	Richard G. Ogier	Flow Optimization in Dynamic and Continuous Networks (Polymatroids, Submodular, Max-Flow Min-Cut)		1985	RDF
20	Balakrishnan Krishnamurthy	An Improved Min-Cut Algorithm for Partitioning VLSI Networks.	IEEE Trans. Computers	1984	DBLP DOI BibTeX RDF	VLSI layout, Partitioning algorithms
20	Mihalis Yannakakis	A Polynomial Algorithm for the Min Cut Linear Arrangement of Trees (Extended Abstract)	FOCS	1983	DBLP DOI BibTeX RDF
20	Moon-Jung Chung, Fillia Makedon, Ivan Hal Sudborough, Jonathan S. Turner	Polynomial Time Algorithms for the Min Cut Problem on Degree Restricted Trees	FOCS	1982	DBLP DOI BibTeX RDF
20	Ulrich Lauther	A min-cut placement algorithm for general cell assemblies based on a graph representation.	DAC	1979	DBLP BibTeX RDF
20	Paul D. Seymour	The matroids with the max-flow min-cut property.	J. Comb. Theory, Ser. B	1977	DBLP DOI BibTeX RDF
20	Melvin A. Breuer	A class of min-cut placement algorithms.	DAC	1977	DBLP BibTeX RDF
20	Alan J. Hoffman	A generalization of max flow - min cut.	Math. Program.	1974	DBLP DOI BibTeX RDF
16	Song Guo 0001, Oliver W. W. Yang, Victor C. M. Leung	Improving Scalability for Longest-lived Multicast Using Localized Operations in WANETs.	SECON	2007	DBLP DOI BibTeX RDF
16	Wai-Kei Mak, Evangeline F. Y. Young	Temporal logic replication for dynamically reconfigurable FPGA partitioning.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2003	DBLP DOI BibTeX RDF
16	Wai-Kei Mak, Evangeline F. Y. Young	Temporal logic replication for dynamically reconfigurable FPGA partitioning.	ISPD	2002	DBLP DOI BibTeX RDF
16	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
16	Gopalakrishnan Vijayan	Min-cost Partitioning on a Tree Structure and Applications.	DAC	1989	DBLP DOI BibTeX RDF
16	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
16	Jinhui Xu 0001, Lei Xu 0006, Evanthia Papadopoulou	Computing the Map of Geometric Minimal Cuts.	ISAAC	2009	DBLP DOI BibTeX RDF
16	Kook Jin Ahn, Sudipto Guha	Graph Sparsification in the Semi-streaming Model.	ICALP (2)	2009	DBLP DOI BibTeX RDF
16	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
16	José M. Bioucas-Dias, Gonçalo Valadão	Phase Unwrapping via Graph Cuts.	IEEE Trans. Image Process.	2007	DBLP DOI BibTeX RDF
16	Hichem Sahbi, Jean-Yves Audibert, Renaud Keriven	Graph-Cut Transducers for Relevance Feedback in Content Based Image Retrieval.	ICCV	2007	DBLP DOI BibTeX RDF
16	Olivier Juan, Yuri Boykov	Capacity Scaling for Graph Cuts in Vision.	ICCV	2007	DBLP DOI BibTeX RDF
16	Lei Wu, Houqiang Li, Nenghai Yu, Mingjing Li	Volume Graph Model for 3D Facial Surface Extraction.	ICME	2007	DBLP DOI BibTeX RDF
16	Branislav Micusík, Tomás Pajdla	Multi-label image segmentation via max-sum solver.	CVPR	2007	DBLP DOI BibTeX RDF
16	Wenxian Yang, King Ngi Ngan	Unsupervised Multiple Object Segmentation of Multiview Images.	ACIVS	2007	DBLP DOI BibTeX RDF
16	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
16	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
16	Douglas J. Kennard, William A. Barrett	Separating Lines of Text in Free-Form Handwritten Historical Documents.	DIAL	2006	DBLP DOI BibTeX RDF