Search results for "Min-Cut"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
191	Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten	Complexity of the Min-Max (Regret) Versions of Cut Problems.	ISAAC	2005	DBLP DOI BibTeX RDF	min-max regret, s–t min cut, complexity, min cut, min-max
150	Hannah Honghua Yang, D. F. Wong 0001	New algorithms for min-cut replication in partitioned circuits.	ICCAD	1995	DBLP DOI BibTeX RDF	Hyper-MAMC, VLSI circuit partitioning, k-way partition, k-way partitioned digraph, min-cut replication, partitioned circuits, VLSI, optimal algorithm, circuit layout CAD, hypergraphs, VLSI layout, digraphs, circuit layout
141	Hannah Honghua Yang, Martin D. F. Wong	Optimal min-area min-cut replication in partitioned circuits.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1998	DBLP DOI BibTeX RDF
101	Kazuhiro Takahashi, Kazuo Nakajima, Masayuki Terai, Koji Sato	Adaptive cut line selection in min-cut placement for large scale sea-of-gates arrays.	ICCAD	1994	DBLP DOI BibTeX RDF
91	Teofilo F. Gonzalez, Toshio Murayama	Alhorithms for a Class of Min-Cut and Max-Cut Problem.	ISAAC	1992	DBLP DOI BibTeX RDF
90	Wai-Kei Mak, D. F. Wong 0001	Minimum replication min-cut partitioning.	ICCAD	1996	DBLP DOI BibTeX RDF	min-cut partitioning, circuit partitioning, logic replication
89	Srinivasa Rao Arikati, Shiva Chaudhuri, Christos D. Zaroliagis	All-Pairs Min-Cut in Sparse Networks.	FSTTCS	1995	DBLP DOI BibTeX RDF
71	Kazuhiro Takahashi, Kazuo Nakajima, Masayuki Terai, Koji Sato	Min-cut placement with global objective functions for large scale sea-of-gates arrays.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1995	DBLP DOI BibTeX RDF
71	Inderpal S. Bhandari, Mark Hirsch, Daniel P. Siewiorek	The Min-cut Shuffle: Toward a Solution for the Global Effect Problem of Min-cut Placement.	DAC	1988	DBLP BibTeX RDF
66	Troy A. Johnson, Rudolf Eigenmann, T. N. Vijaykumar	Min-cut program decomposition for thread-level speculation.	PLDI	2004	DBLP DOI BibTeX RDF	partitioning, chip multiprocessor, thread-level speculation, min-cut, program decomposition
66	Wai-Kei Mak, Martin D. F. Wong	Minimum replication min-cut partitioning.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1997	DBLP DOI BibTeX RDF
65	Andrew B. Kahng, Sherief Reda	Placement feedback: a concept and method for better min-cut placements.	DAC	2004	DBLP DOI BibTeX RDF	min-cut placement, terminal propagation, feedback
61	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
61	Frank Vahid	Modifying Min-Cut for Hardware and Software Functional Partitioning.	CODES	1997	DBLP DOI BibTeX RDF	Kernighan/Lin, min-cut, Functional partitioning
57	Jue Wang 0001, Pravin Bhat, Alex Colburn, Maneesh Agrawala, Michael F. Cohen	Interactive video cutout.	ACM Trans. Graph.	2005	DBLP DOI BibTeX RDF	alpha matting, interactive video processing, mean-shift segmentation, graph-cut, min-cut
56	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
56	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
56	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
56	Md. Altaf-Ul-Amin, Toshihiro Koma, Ken Kurokawa, Shigehiko Kanaya	Prediction of Protein Functions Based on Protein-Protein Interaction Networks: A Min-Cut Approach.	ICDE Workshops	2005	DBLP DOI BibTeX RDF	heuristic method, min-cut, protein function prediction, protein-protein interaction network
56	Mikkel Thorup	Fully-dynamic min-cut.	STOC	2001	DBLP DOI BibTeX RDF
53	Mark R. Hartoog	Analysis of placement procedures for VLSI standard cell layout.	DAC	1986	DBLP DOI BibTeX RDF
51	Jarrod A. Roy, Saurabh N. Adya, David A. Papa, Igor L. Markov	Min-cut floorplacement.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2006	DBLP DOI BibTeX RDF
51	Daniel Golovin, Vineet Goyal, R. Ravi 0001	Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems.	STACS	2006	DBLP DOI BibTeX RDF
51	Wai-Kei Mak	Min-cut partitioning with functional replication fortechnology-mapped circuits using minimum area overhead.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2002	DBLP DOI BibTeX RDF
51	Wai-Kei Mak	Min-cut partitioning with functional replication for technology mapped circuits using minimum area overhead.	ISPD	2001	DBLP DOI BibTeX RDF	minimum cut, circuit partitioning, logic replication
46	Yuri Boykov, Vladimir Kolmogorov	An Experimental Comparison of Min-cut/Max-flow Algorithms for Energy Minimization in Vision.	EMMCVPR	2001	DBLP DOI BibTeX RDF
45	Anil Raj, Chris H. Wiggins 0001	An Information-Theoretic Derivation of Min-Cut-Based Clustering.	IEEE Trans. Pattern Anal. Mach. Intell.	2010	DBLP DOI BibTeX RDF	graph diffusion, clustering, Graphs, information theory, min-cut, Information Bottleneck
45	Mechthild Stoer, Frank Wagner 0001	A simple min-cut algorithm.	J. ACM	1997	DBLP DOI BibTeX RDF	min-cut
44	Gopalakrishnan Vijayan	Generalization of Min-Cut Partitioning to Tree Structures and Its Applications.	IEEE Trans. Computers	1991	DBLP DOI BibTeX RDF	min-cut partitioning, hyperedges, VLSI design applications, iterative improvement heuristic, routing, computational complexity, data structures, trees (mathematics), hypergraph, minimisation, minimisation, tree structures, vertices, cost function, nodes, pins
44	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
41	Andrew B. Kahng, Sherief Reda	Wirelength minimization for min-cut placements via placement feedback.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2006	DBLP DOI BibTeX RDF
41	Mala L. Radhakrishnan, Sara L. Su	Dead-End Elimination as a Heuristic for Min-Cut Image Segmentation.	ICIP	2006	DBLP DOI BibTeX RDF
41	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
41	Andrew B. Kahng, Igor L. Markov, Sherief Reda	Boosting: Min-Cut Placement with Improved Signal Delay.	DATE	2004	DBLP DOI BibTeX RDF
41	Honghua Yang, D. F. Wong 0001	Efficient network flow based min-cut balanced partitioning.	ICCAD	1994	DBLP DOI BibTeX RDF
41	Burkhard Monien, Ivan Hal Sudborough	Min Cut is NP-Complete for Edge Weigthed Trees.	ICALP	1986	DBLP DOI BibTeX RDF
40	Andrew B. Kahng, Igor L. Markov, Sherief Reda	On legalization of row-based placements.	ACM Great Lakes Symposium on VLSI	2004	DBLP DOI BibTeX RDF	min-cut placement, legalization, detailed placement
40	Mikkel Thorup	Fully-Dynamic Min-Cut.	Comb.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 68Q25, 68W05, 94C12, 94C15, 90B25, 68R10, 05C85, 05C40, 90B10
40	Oktay Günlük	A New Min-Cut Max-Flow Ratio for Multicommodity Flows.	IPCO	2002	DBLP DOI BibTeX RDF
38	Hannah Honghua Yang, Martin D. F. Wong	Balanced partitioning.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1996	DBLP DOI BibTeX RDF
36	Stanislav Zivný, David A. Cohen, Peter G. Jeavons	The Expressive Power of Binary Submodular Functions.	MFCS	2009	DBLP DOI BibTeX RDF	Decomposition of submodular functions, Pseudo-Boolean optimisation, Submodular function minimisation, Min-Cut
36	Ming Leng, Songnian Yu, Yang Chen	An Effective Refinement Algorithm Based on Multilevel Paradigm for Graph Bipartitioning.	PROLAMAT	2006	DBLP DOI BibTeX RDF	multilevel paradigm, Tabu search, min-cut, graph bipartitioning
35	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
35	Dietmar Ebner, Bernhard Scholz, Andreas Krall	Progressive spill code placement.	CASES	2009	DBLP DOI BibTeX RDF	constrained min-cut, spilling, register allocation, SSA form
35	Guilherme Ottoni, David I. August	Communication optimizations for global multi-threaded instruction scheduling.	ASPLOS	2008	DBLP DOI BibTeX RDF	graph min-cut, communication, synchronization, data-flow analysis, multi-threading, instruction scheduling
35	Tung-Chieh Chen, Yi-Lin Chuang, Yao-Wen Chang	X-architecture placement based on effective wire models.	ISPD	2007	DBLP DOI BibTeX RDF	X architecture, partitioning, placement, physical design, Steiner tree, min cut, net weighting
35	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
35	Timothy Gatzke, Cindy Grimm	Feature Detection Using Curvature Maps and the Min-cut/Max-flow Algorithm.	GMP	2006	DBLP DOI BibTeX RDF
33	Maren Martens, S. Thomas McCormick	A Polynomial Algorithm for Weighted Abstract Flow.	IPCO	2008	DBLP DOI BibTeX RDF
32	Saurabh N. Adya, S. Chaturvedi, Jarrod A. Roy, David A. Papa, Igor L. Markov	Unification of partitioning, placement and floorplanning.	ICCAD	2004	DBLP DOI BibTeX RDF
32	Ghazi Al-Rawi, John M. Cioffi, Mark Horowitz	Optimizing the Mapping of Low-Density Parity Check Codes on Parallel Decoding Architectures.	ITCC	2001	DBLP DOI BibTeX RDF
31	Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi	Efficient algorithms for computing all low s-t edge connectivities and related problems.	SODA	2007	DBLP BibTeX RDF
30	Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman	Single source multiroute flows and cuts on uniform capacity networks.	SODA	2007	DBLP BibTeX RDF
30	Nawal Houhou, Xavier Bresson, Arthur Szlam, Tony F. Chan, Jean-Philippe Thiran	Semi-supervised Segmentation Based on Non-local Continuous Min-Cut.	SSVM	2009	DBLP DOI BibTeX RDF
30	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
30	Volker Elling, Karsten Schwan	Min-Cut Methods for Mapping Dataflow Graphs.	Euro-Par	1999	DBLP DOI BibTeX RDF
30	Dorothea Wagner, Frank Wagner 0001	Between Min Cut and Graph Bisection.	MFCS	1993	DBLP DOI BibTeX RDF
30	Masayuki Terai, Kazuhiro Takahashi, Koji Sato	A New Min-Cut Placement Algorithm for Timing Assurance Layout Design Meeting Net Length Constraint.	DAC	1990	DBLP DOI BibTeX RDF
30	Song Guo 0001, Victor C. M. Leung	A Distributed Algorithm for Min-Max Tree and Max-Min Cut Problems in Communication Networks.	IEEE/ACM Trans. Netw.	2010	DBLP DOI BibTeX RDF
30	Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten	Complexity of the min-max (regret) versions of min cut problems.	Discret. Optim.	2008	DBLP DOI BibTeX RDF
30	David R. Karger	Global Min-cuts in RNC, and Other Ramifications of a Simple Min-Cut Algorithm.	SODA	1993	DBLP DOI BibTeX RDF
29	Sudhanshu Chanpuriya, Cameron Musco	Latent Random Steps as Relaxations of Max-Cut, Min-Cut, and More.	CoRR	2023	DBLP DOI BibTeX RDF
29	Amir Abboud, Robert Krauthgamer, Ohad Trabelsi	Cut-Equivalent Trees are Optimal for Min-Cut Queries.	CoRR	2020	DBLP BibTeX RDF
29	Amir Abboud, Robert Krauthgamer, Ohad Trabelsi	Cut-Equivalent Trees are Optimal for Min-Cut Queries.	FOCS	2020	DBLP DOI BibTeX RDF
29	Sagnik Mukhopadhyay, Danupon Nanongkai	Weighted min-cut: sequential, cut-query, and streaming algorithms.	STOC	2020	DBLP DOI BibTeX RDF
29	Sagnik Mukhopadhyay, Danupon Nanongkai	Weighted Min-Cut: Sequential, Cut-Query and Streaming Algorithms.	CoRR	2019	DBLP BibTeX RDF
29	Vladimir A. Bondarenko, Andrei V. Nikolaev	On Graphs of the Cone Decompositions for the Min-Cut and Max-Cut Problems.	Int. J. Math. Math. Sci.	2016	DBLP DOI BibTeX RDF
28	David R. Karger, Debmalya Panigrahi	A near-linear time algorithm for constructing a cactus representation of minimum cuts.	SODA	2009	DBLP DOI BibTeX RDF
27	Andrew E. Caldwell, Andrew B. Kahng, Igor L. Markov	Can recursive bisection alone produce routable placements?	DAC	2000	DBLP DOI BibTeX RDF
27	Joseph S. B. Mitchell	On Maximum Flows in Polyhedral Domains.	SCG	1988	DBLP DOI BibTeX RDF
26	Aurore Amaudruz, Christina Fragouli	Combinatorial algorithms for wireless information flow.	SODA	2009	DBLP DOI BibTeX RDF
26	Sagi Snir, Satish Rao	Using Max Cut to Enhance Rooted Trees Consistency.	IEEE ACM Trans. Comput. Biol. Bioinform.	2006	DBLP DOI BibTeX RDF	rooted triplets, semidefinite programming, Phylogenetic trees, supertrees
26	Charles J. Alpert, Tony F. Chan, Dennis J.-H. Huang, Igor L. Markov, Kenneth Yan	Quadratic Placement Revisited.	DAC	1997	DBLP DOI BibTeX RDF
26	Timo Kötzing, Per Kristian Lehre, Frank Neumann 0001, Pietro S. Oliveto	Ant colony optimization and the minimum cut problem.	GECCO	2010	DBLP DOI BibTeX RDF	ant colony optimization, min-cut
26	David R. Karger	Minimum cuts in near-linear time.	J. ACM	2000	DBLP DOI BibTeX RDF	tree packing, optimization, connectivity, min-cut, Monte Carlo algorithm
25	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
25	Ishai Menache, Shie Mannor, Nahum Shimkin	Q-Cut - Dynamic Discovery of Sub-goals in Reinforcement Learning.	ECML	2002	DBLP DOI BibTeX RDF
25	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
25	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
25	Vladimir Kolmogorov, Carsten Rother	Minimizing Nonsubmodular Functions with Graph Cuts-A Review.	IEEE Trans. Pattern Anal. Mach. Intell.	2007	DBLP DOI BibTeX RDF	quadratic pseudo-Boolean optimization, min cut/max flow, texture restoration, Markov Random Fields, Energy minimization
25	Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi, Anand Bhalgat	An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs.	STOC	2007	DBLP DOI BibTeX RDF	Gomory-Hu tree, cut tree, steiner edge connectivity, edge connectivity, min cut
25	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
25	Christina Fragouli, Tarik Tabet	On conditions for constant throughput in wireless networks.	ACM Trans. Sens. Networks	2006	DBLP DOI BibTeX RDF	Foundations of sensor and ad hoc networks, constant throughput, min cut bounds, sensor networks throughput, mobility, wireless networks, mobility model, multicommodity flow
25	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
25	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
25	Palash Sarkar 0001, Paul J. Schellenberg	Construction of Symmetric Balanced Squares with Blocksize More than One.	Des. Codes Cryptogr.	2003	DBLP DOI BibTeX RDF	symmetric Latin square, symmetric balanced square, min cut-max flow theorem, combinatorial design
25	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
25	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
25	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
22	Gopalakrishnan Vijayan	Partitioning logic on graph structures to minimize routing cost.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1990	DBLP DOI BibTeX RDF
21	L. Darrell Whitley, Andrew M. Sutton	Partial neighborhoods of elementary landscapes.	GECCO	2009	DBLP DOI BibTeX RDF	elementary landscapes, fitness landscapes
21	Stanislav Zivný, Peter G. Jeavons	The Complexity of Valued Constraint Models.	CP	2009	DBLP DOI BibTeX RDF
21	Yung-Chuan Jiang, Jhing-Fa Wang	Temporal Partitioning Data Flow Graphs for Dynamically Reconfigurable Computing.	IEEE Trans. Very Large Scale Integr. Syst.	2007	DBLP DOI BibTeX RDF
21	Mohit Lad, Ricardo V. Oliveira, Daniel Massey, Lixia Zhang 0001	Inferring the Origin of Routing Changes using Link Weights.	ICNP	2007	DBLP DOI BibTeX RDF
21	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
21	Aseem Agarwala, Ke Colin Zheng, Chris Pal, Maneesh Agrawala, Michael F. Cohen, Brian Curless, David Salesin, Richard Szeliski	Panoramic video textures.	ACM Trans. Graph.	2005	DBLP DOI BibTeX RDF	panoramas, video-based rendering, video textures
21	Indra Geys, Thomas P. Koninckx, Luc Van Gool	Fast Interpolated Cameras by Combining a GPU based Plane Sweep with a Max-Flow Regularisation Algorithm.	3DPVT	2004	DBLP DOI BibTeX RDF
21	Jittat Fakcharoenphol, Kunal Talwar	An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor.	RANDOM-APPROX	2003	DBLP DOI BibTeX RDF
21	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
21	Chris Buehler, Steven J. Gortler, Michael F. Cohen, Leonard McMillan	Minimal Surfaces for Stereo.	ECCV (3)	2002	DBLP DOI BibTeX RDF