Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
A new approach to the maximum-flow problem
Journal of the ACM (JACM)
Improved time bounds for the maximum flow problem
SIAM Journal on Computing
Can a maximum flow be computed in o(nm) time?
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Generating pseudo-random permutations and maximum flow algorithms
Information Processing Letters
Computing edge-connectivity in multigraphs and capacitated graphs
SIAM Journal on Discrete Mathematics
A faster algorithm for finding the minimum cut in a graph
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
An Õ(n2) algorithm for minimum cuts
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
LEDA: a platform for combinatorial and geometric computing
Communications of the ACM
A combinatorial algorithm for minimizing symmetric submodular functions
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A linear time 2 + &&egr; approximation algorithm for edge connectivity
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
An algorithm for clustering cDNAs for gene expression analysis
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Page access scheduling in join processing
Proceedings of the eighth international conference on Information and knowledge management
Locating sources to meet flow demands in undirected networks
Journal of Algorithms
Parametric analysis of overall min-cuts and applications in undirected networks
Information Processing Letters
Locating Sources to Meet Flow Demands in Undirected Networks
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
Graph connectivity and its augmentation: applications of MA orderings
Discrete Applied Mathematics
Adaptive Offloading Inference for Delivering Applications in Pervasive Computing Environments
PERCOM '03 Proceedings of the First IEEE International Conference on Pervasive Computing and Communications
A note on the minimization of symmetric and general submodular functions
Discrete Applied Mathematics - Submodularity
Cardinality constrained minimum cut problems: complexity and algorithms
Discrete Applied Mathematics
Adaptive Offloading for Pervasive Computing
IEEE Pervasive Computing
Mining closed relational graphs with connectivity constraints
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Using Max Cut to Enhance Rooted Trees Consistency
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
An effective offloading middleware for pervasive services on mobile devices
Pervasive and Mobile Computing
Compacting cuts: a new linear formulation for minimum cut
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A tutorial on spectral clustering
Statistics and Computing
Communities in graphs and hypergraphs
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
A genetic algorithm for frequency assignment with problem decomposition
International Journal of Mobile Network Design and Innovation
Game theoretic models for detecting network intrusions
Computer Communications
SkyGraph: an algorithm for important subgraph discovery in relational graphs
Data Mining and Knowledge Discovery
A Graph Clustering Algorithm Based on Minimum and Normalized Cut
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
A Feasibility-Preserving Crossover and Mutation Operator for Constrained Combinatorial Problems
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Minimum Cuts of Simple Graphs in Almost Always Linear Time
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Bid optimization for broad match ad auctions
Proceedings of the 18th international conference on World wide web
Compacting cuts: A new linear formulation for minimum cut
ACM Transactions on Algorithms (TALG)
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Underwater sensor deployment using an evolutionary algorithm
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Mining globally distributed frequent subgraphs in a single labeled graph
Data & Knowledge Engineering
Progressive spill code placement
CASES '09 Proceedings of the 2009 international conference on Compilers, architecture, and synthesis for embedded systems
Frame semantic enhancement of lexical-semantic resources
DeepLA '05 Proceedings of the ACL-SIGLEX Workshop on Deep Lexical Acquisition
A clustering algorithm for interval graph test on noisy data
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Exploring group moving pattern for an energy-constrained object tracking sensor network
PAKDD'07 Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
The complexity of valued constraint models
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Finding minimum 3-way cuts in hypergraphs
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Finding minimum 3-way cuts in hypergraphs
Information Processing Letters
Increased connectivity at lower cost: The case for multi-radio nodes in multi-hop wireless networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
On approximation of new optimization methods for assessing network vulnerability
INFOCOM'10 Proceedings of the 29th conference on Information communications
On the effects of deployment imprecision on underwater sensor connectivity
Proceedings of the Fifth ACM International Workshop on UnderWater Networks
Optimal WCET-aware code selection for scratchpad memory
EMSOFT '10 Proceedings of the tenth ACM international conference on Embedded software
C&C: an effective algorithm for extracting web community cores
DASFAA'10 Proceedings of the 15th international conference on Database systems for advanced applications
Advanced combinatorial algorithms
Algorithms and theory of computation handbook
A graph model for clustering based on mutual information
PRICAI'10 Proceedings of the 11th Pacific Rim international conference on Trends in artificial intelligence
A metaheuristic based on fusion and fission for partitioning problems
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Design of network topology in an adversarial environment
GameSec'10 Proceedings of the First international conference on Decision and game theory for security
TAGs: scalable threshold-based algorithms for proximity computation in graphs
Proceedings of the 14th International Conference on Extending Database Technology
A game theoretic approach for feature clustering and its application to feature selection
PAKDD'11 Proceedings of the 15th Pacific-Asia conference on Advances in knowledge discovery and data mining - Volume Part I
Discovering highly reliable subgraphs in uncertain graphs
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
An optimal algorithm for layer assignment of bus escape routing on PCBs
Proceedings of the 48th Design Automation Conference
A graph model for mutual information based clustering
Journal of Intelligent Information Systems
Improved formulations for the ring spur assignment problem
INOC'11 Proceedings of the 5th international conference on Network optimization
RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
GRID '11 Proceedings of the 2011 IEEE/ACM 12th International Conference on Grid Computing
Hearing the clusters of a graph: A distributed algorithm
Automatica (Journal of IFAC)
Partitioning planar graphs: a fast combinatorial approach for max-cut
Computational Optimization and Applications
Web Semantics: Science, Services and Agents on the World Wide Web
Multicriteria global minimum cuts
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I
A simple and fast min-cut algorithm
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Structure-Based resilience metrics for service-oriented networks
EDCC'05 Proceedings of the 5th European conference on Dependable Computing
A register allocation framework for banked register files with access constraints
ACSAC'05 Proceedings of the 10th Asia-Pacific conference on Advances in Computer Systems Architecture
Assessing significance of connectivity and conservation in protein interaction networks
RECOMB'06 Proceedings of the 10th annual international conference on Research in Computational Molecular Biology
Network security situation evaluation method for distributed denial of service
ACC'11/MMACTEE'11 Proceedings of the 13th IASME/WSEAS international conference on Mathematical Methods and Computational Techniques in Electrical Engineering conference on Applied Computing
Computing minimum multiway cuts in hypergraphs from hypertree packings
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
A combinatorial model and algorithm for globally searching community structure in complex networks
Journal of Combinatorial Optimization
Finding maximal k-edge-connected subgraphs from a large graph
Proceedings of the 15th International Conference on Extending Database Technology
Computer Science Review
Complexity of the min-max (regret) versions of min cut problems
Discrete Optimization
COCA: Computation Offload to Clouds Using AOP
CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
On new approaches of assessing network vulnerability: hardness and approximation
IEEE/ACM Transactions on Networking (TON)
Sparse spectral clustering method based on the incomplete Cholesky decomposition
Journal of Computational and Applied Mathematics
Adaptive application offloading using distributed abstract class graphs in mobile environments
Journal of Systems and Software
Proceedings of the 21st ACM international conference on Information and knowledge management
Efficiently computing k-edge connected components via graph decomposition
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Minimizing code size via page selection optimization on partitioned memory architectures
Proceedings of the 2013 International Conference on Compilers, Architectures and Synthesis for Embedded Systems
Bandwidth-adaptive partitioning for distributed execution optimization of mobile applications
Journal of Network and Computer Applications
| Hi-index | 0.01 |
We present an algorithm for finding the minimum cut of an undirected edge-weighted graph. It is simple in every respect. It has a short and compact description, is easy to implement, and has a surprisingly simple proof of correctness. Its runtime matches that of the fastest algorithm known. The runtime analysis is straightforward. In contrast to nearly all approaches so far, the algorithm uses no flow techniques. Roughly speaking, the algorithm consists of about |V| nearly identical phases each of which is a maximum adjacency search.