Data structures and network algorithms
Data structures and network algorithms
Self-adjusting binary search trees
Journal of the ACM (JACM)
Complexity of network synchronization
Journal of the ACM (JACM)
Scaling algorithms for network problems
Journal of Computer and System Sciences
A new approach to the maximum flow problem
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
An O(n2 log n) parallel max-flow algorithm
Journal of Algorithms
A data structure for dynamic trees
Journal of Computer and System Sciences
Finding minimum-cost circulations by successive approximation
Mathematics of Operations Research
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Graph Algorithms
Parallelism in random access machines
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
EFFICIENT GRAPH ALGORITHMS FOR SEQUENTIAL AND PARALLEL COMPUTERS
EFFICIENT GRAPH ALGORITHMS FOR SEQUENTIAL AND PARALLEL COMPUTERS
An O($n\cdot I \log^2 I$) maximum-flow algorithm
An O($n\'cdot I \'log^2 I$) maximum-flow algorithm
Finding minimum-cost circulations by canceling negative cycles
Journal of the ACM (JACM)
Code duplication: an assist for global instruction scheduling
MICRO 24 Proceedings of the 24th annual international symposium on Microarchitecture
The complexity of multiway cuts (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A faster deterministic maximum flow algorithm
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
A faster algorithm for finding the minimum cut in a graph
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Minimizing capacity violations in a transshipment network
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
On the parallel implementation of Goldberg's maximum flow algorithm
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Approximate decision algorithms for point set congruence
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Online load balancing and network flow
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
An Õ(n2) algorithm for minimum cuts
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The network inhibition problem
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A universal-scheme approach to statistical databases containing homogeneous summary tables
ACM Transactions on Database Systems (TODS)
Lower bounds for parallel linear programming and other problems
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Augmenting undirected connectivity in RNC and in randomized Õ(n3) time
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Linear decomposition algorithm for VLSI design applications
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Many-to-one packet routing on grids
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A new approach to the minimum cut problem
Journal of the ACM (JACM)
Approximating s-t minimum cuts in Õ(n2) time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Deterministic Õ(nm) time edge-splitting in undirected graphs
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Fast algorithms for parametric scheduling come from extensions to parametric maximum flow
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Strategic directions in research in theory of computing
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Minimum replication min-cut partitioning
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Is there an algebraic proof for P ≠ NC? (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Beyond the flow decomposition barrier
Journal of the ACM (JACM)
Augment or push: a computational study of bipartite matching and unit-capacity flow algorithms
Journal of Experimental Algorithmics (JEA)
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Global min-cuts in RNC, and other ramifications of a simple min-out algorithm
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Algorithms for graphic polymatroids and parametric s-Sets
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A data structure for dynamically maintaining rooted trees
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Fast approximation algorithm for minimum cost multicommodity flow
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Experimental study of minimum cut algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for the discrete time-cost tradeoff problem
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Faster algorithms for the quickest transshipment problem with zero transit times
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A faster algorithm for minimum cost submodular flows
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A new property and a faster algorithm for baseball elimination
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Reconfiguration Models and Algorithms for Stateful Interactive Processes
IEEE Transactions on Software Engineering
Authentication metric analysis and design
ACM Transactions on Information and System Security (TISSEC)
Minimum cuts in near-linear time
Journal of the ACM (JACM)
Improved algorithms for submodular function minimization and submodular flow
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Downlink scheduling in CDMA data networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
IEEE Transactions on Computers
Edge separability based circuit clustering with application to circuit partitioning
ASP-DAC '00 Proceedings of the 2000 Asia and South Pacific Design Automation Conference
An efficient algorithm for image segmentation, Markov random fields and related problems
Journal of the ACM (JACM)
Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Post-pass binary adaptation for software-based speculative precomputation
PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
Three-Dimensional Reconstruction of Points and Lines with Unknown Correspondence across Images
International Journal of Computer Vision
Reachability and distance queries via 2-hop labels
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
International Journal of Parallel Programming
A Zoom-In Approach to Design SDH Mesh Restorable Networks
Journal of Heuristics
A primal-dual approximation algorithm for the survivable network design problem in hypergraphs
Discrete Applied Mathematics
What Energy Functions Can Be Minimized via Graph Cuts?
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part III
Q-Cut - Dynamic Discovery of Sub-goals in Reinforcement Learning
ECML '02 Proceedings of the 13th European Conference on Machine Learning
The Pseudoflow Algorithm and the Pseudoflow-Based Simplex for the Maximum Flow Problem
Proceedings of the 6th International IPCO Conference on Integer Programming and Combinatorial Optimization
A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Universally Maximum Flow with Piecewise-Constant Capacities
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Polynomial-Time Separation of Simple Comb Inequalities
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
On the Complexity of the Minimum and Maximum Global Snapshot Problems
COMPSAC '97 Proceedings of the 21st International Computer Software and Applications Conference
Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Efficient Algorithms for k-Terminal Cuts on Planar Graphs
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
An Experimental Comparison of Min-cut/Max-flow Algorithms for Energy Minimization in Vision
EMMCVPR '01 Proceedings of the Third International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition
Instant recognition of polynominal time solvability, half integrality and 2-approximations
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Second-Order Methods for Distributed Approximate Single- and Multicommodity Flow
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Computing the Envelope for Stepwise-Constant Resource Allocations
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Minimizing a Convex Cost Closure Set
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
An efficient minimum and maximum global snapshot algorithm
Information Processing Letters
An Efficient Practical Heuristic For Good Ratio-Cut Partitioning
VLSID '03 Proceedings of the 16th International Conference on VLSI Design
Hierarchical mesh decomposition using fuzzy clustering and cuts
ACM SIGGRAPH 2003 Papers
The maximum flow problem: a real-time approach
Parallel Computing
Random Redundant Storage in Disk Arrays: Complexity of Retrieval Problems
IEEE Transactions on Computers
Discrete Applied Mathematics - Submodularity
Improving graph partitions using submodular functions
Discrete Applied Mathematics - Submodularity
Playing hide-and-seek with correlations
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
What Energy Functions Can Be Minimizedvia Graph Cuts?
IEEE Transactions on Pattern Analysis and Machine Intelligence
Solving Project Scheduling Problems by Minimum Cut Computations
Management Science
Minimal Cost Replication of Dynamic Web Contents under Flat Update Delivery
IEEE Transactions on Parallel and Distributed Systems
A fast approximation scheme for fractional covering problems with variable upper bounds
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Optimizing for space and time usage with speculative partial redundancy elimination
Proceedings of the 2004 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
Computing Nash equilibria for scheduling on restricted parallel links
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
Adaptive Teamwork Coordination Using Graph Matching over Hierarchical Intentional Structures
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
Algorithmic aspects of hardware/software partitioning
ACM Transactions on Design Automation of Electronic Systems (TODAES)
A self-stabilizing algorithm for the maximum flow problem
Distributed Computing
Sequential and parallel algorithms for minimum flows
The Korean Journal of Computational & Applied Mathematics
Max-flow problem in undirected planar networks with node capacities being in NC
Journal of Computer Science and Technology
Maximum-lifetime routing algorithms for networks with omnidirectional and directional antennas
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Design of capacitated survivable networks with a single facility
IEEE/ACM Transactions on Networking (TON)
Online client-server load balancing without global information
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Partition-based logical reasoning for first-order and propositional theories
Artificial Intelligence - Special volume on reformulation
Supermodular functions and the complexity of MAX CSP
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Multiple Job Scheduling in a Connection-Limited Data Parallel System
IEEE Transactions on Parallel and Distributed Systems
On finding the minimum test set of a BDD-based circuit
GLSVLSI '06 Proceedings of the 16th ACM Great Lakes symposium on VLSI
Database support for matching: limitations and opportunities
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Graph Cuts and Efficient N-D Image Segmentation
International Journal of Computer Vision
Implementing approximation algorithms for the single-source unsplittable flow problem
Journal of Experimental Algorithmics (JEA)
Public infrastructures for internet access in metropolitan areas
AcessNets '06 Proceedings of the 1st international conference on Access networks
Efficient agent-based simulation framework for multi-node supercomputers
Proceedings of the 38th conference on Winter simulation
Assembly synthesis with subassembly partitioning for optimal in-process dimensional adjustability
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
Polynomial-Time Separation of a Superclass of Simple Comb Inequalities
Mathematics of Operations Research
An efficient packet scheduling algorithm with deadline guarantees for input-queued switches
IEEE/ACM Transactions on Networking (TON)
Balancing applied to maximum network flow problems
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Multipath routing algorithms for congestion minimization
IEEE/ACM Transactions on Networking (TON)
Free multiflows in bidirected and skew-symmetric graphs
Discrete Applied Mathematics
Maximum s-t-flow with k crossings in O(k3n log n) time
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Trade-offs between mobility and density for coverage in wireless sensor networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
A new efficient retiming algorithm derived by formal manipulation
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Game Theoretic Stochastic Routing for Fault Tolerance and Security in Computer Networks
IEEE Transactions on Parallel and Distributed Systems
Efficient preflow push algorithms
Computers and Operations Research
Crown reductions for the Minimum Weighted Vertex Cover problem
Discrete Applied Mathematics
Shape matching and modeling using skeletal context
Pattern Recognition
Shape matching and modeling using skeletal context
Pattern Recognition
Optimistic parallelism benefits from data partitioning
Proceedings of the 13th international conference on Architectural support for programming languages and operating systems
Clustering, community partition and disjoint spanning trees
ACM Transactions on Algorithms (TALG)
Improved quasi-path restoration in mesh networks
IEEE/ACM Transactions on Networking (TON)
Distributed algorithms for secure multipath routing in attack-resistant networks
IEEE/ACM Transactions on Networking (TON)
Simultaneous on-chip bus synthesis and voltage scaling under random on-chip data traffic
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Efficient network flow based ratio-cut netlist hypergraph partitioning
ICECS'03 Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing
Geometrical k-cut problem and an optimal solution for hypercubes
MATH'07 Proceedings of the 12th WSEAS International Conference on Applied Mathematics
Scheduling strategies for optimistic parallel execution of irregular programs
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Atomic Vector Operations on Chip Multiprocessors
ISCA '08 Proceedings of the 35th Annual International Symposium on Computer Architecture
Stream data gathering in wireless sensor networks within expected lifetime
Proceedings of the 3rd international conference on Mobile multimedia communications
Mobile Networks and Applications
An Experimental Evaluation of Probabilistic Simulation
FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Efficient Algorithms for the k Smallest Cuts Enumeration
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
The Partial Augment---Relabel Algorithm for the Maximum Flow Problem
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Classes of Submodular Constraints Expressible by Graph Cuts
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
3D shape recursive decomposition by Poisson equation
Pattern Recognition Letters
About preflow algorithms for the minimum flow problem
WSEAS Transactions on Computer Research
An Experimental Comparison of Discrete and Continuous Shape Optimization Methods
ECCV '08 Proceedings of the 10th European Conference on Computer Vision: Part I
Journal of Network and Systems Management
High Resolution Satellite Classification with Graph Cut Algorithms
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing, Part II
Sequential and parallel deficit scaling algorithms for minimum flow in bipartite networks
WSEAS Transactions on Computers
An algorithm for minimum flows
WSEAS Transactions on Computers
An O(n log n) algorithm for maximum st-flow in a directed planar graph
Journal of the ACM (JACM)
How much parallelism is there in irregular applications?
Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming
Minimum Cuts of Simple Graphs in Almost Always Linear Time
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Executability of scenarios in Petri nets
Theoretical Computer Science
A parallel algorithm for the minimum flow problem in bipartite networks
ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
Decreasing path algorithm for minimum flows: dynamic tree implementations
ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
A graph theoretic approach to protein structure selection
Artificial Intelligence in Medicine
Homology flows, cohomology cuts
Proceedings of the forty-first annual ACM symposium on Theory of computing
Minimum cuts and shortest homologous cycles
Proceedings of the twenty-fifth annual symposium on Computational geometry
Mining discrete patterns via binary matrix factorization
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
L0-Norm and Total Variation for Wavelet Inpainting
SSVM '09 Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision
An optimal algorithm for tree geometrical k-cut problem
MACMESE'08 Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering
The wave preflow algorithm for the minimum flow problem
MACMESE'08 Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering
Two-Level Push-Relabel Algorithm for the Maximum Flow Problem
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Maximum Bipartite Flow in Networks with Adaptive Channel Width
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Rate control for network coding based multicast: a hierarchical decomposition approach
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Exploring alternatives for transition verification
Journal of Systems and Software
A Gradient Descent Approximation for Graph Cuts
Proceedings of the 31st DAGM Symposium on Pattern Recognition
Real-Time Online Video Object Silhouette Extraction Using Graph Cuts on the GPU
ICIAP '09 Proceedings of the 15th International Conference on Image Analysis and Processing
Handling inheritance violation for secure interoperation of heterogeneous systems
International Journal of Security and Networks
A maximal tractable class of soft constraints
Journal of Artificial Intelligence Research
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A maximal tractable class of soft constraints
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
About flow problems in networks with node capacities
WSEAS Transactions on Computers
Discrete Applied Mathematics
Partition-based logical reasoning for first-order and propositional theories
Artificial Intelligence - Special volume on reformulation
The nested chinese restaurant process and bayesian nonparametric inference of topic hierarchies
Journal of the ACM (JACM)
Framework for evaluating clustering algorithms in duplicate detection
Proceedings of the VLDB Endowment
Structure-driven optimizations for amorphous data-parallel programs
Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Nonlinear synaptic neural network for maximum flow problems
IJCNN'09 Proceedings of the 2009 international joint conference on Neural Networks
Supermodular functions and the complexity of MAX CSP
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
A polynomial algorithm for partitioning problems
ACM Transactions on Embedded Computing Systems (TECS)
Bisection approach for pixel labelling problem
Pattern Recognition
Cost minimisation in multi-interface networks
NET-COOP'07 Proceedings of the 1st EuroFGI international conference on Network control and optimization
Flow faster: efficient decision algorithms for probabilistic simulations
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
A faster algorithm for computing minimum 5-way and 6-way cuts in graphs
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Experimental evaluation of parametric max-flow algorithms
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Deciding simulations on probabilistic automata
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
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
Pruning network coding traffic by network coding: a new class of max-flow algorithms
IEEE Transactions on Information Theory
On Variational Curve Smoothing and Reconstruction
Journal of Mathematical Imaging and Vision
Balanced allocation with succinct representation
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
A survey on secure multipath routing protocols in WSNs
Computer Networks: The International Journal of Computer and Telecommunications Networking
Relating Reputation and Money in Online Markets
ACM Transactions on the Web (TWEB)
Fast localize the bioluminescent source via graph CUTS
ISBI'10 Proceedings of the 2010 IEEE international conference on Biomedical imaging: from nano to Macro
A new strategy for the undirected two-commodity maximum flow problem
Computational Optimization and Applications
Symbolic execution of acyclic workflow graphs
BPM'10 Proceedings of the 8th international conference on Business process management
Algorithms and theory of computation handbook
Counting minimum (s, t)-cuts in weighted planar graphs in polynomial time
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Energy minimization under constraints on label counts
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part II
A simple dual-RAMP algorithm for resource constraint project scheduling
Proceedings of the 48th Annual Southeast Regional Conference
An efficient graph cut algorithm for computer vision problems
ECCV'10 Proceedings of the 11th European conference on computer vision conference on Computer vision: Part III
An optimal algorithm for general array geometrical k-cut problem
MMACTEE'09 Proceedings of the 11th WSEAS international conference on Mathematical methods and computational techniques in electrical engineering
Synthesizing concurrent schedulers for irregular algorithms
Proceedings of the sixteenth international conference on Architectural support for programming languages and operating systems
Improved Moves for Truncated Convex Models
The Journal of Machine Learning Research
$O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ Time
SIAM Journal on Computing
Constrained minimum lightpath affinity routing in multi-layer optical transport networks
Journal of High Speed Networks
Brief announcement: better speedups for parallel max-flow
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Exploiting the commutativity lattice
Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
Improved algorithms for min cut and max flow in undirected planar graphs
Proceedings of the forty-third annual ACM symposium on Theory of computing
Segmentation using iso-perimetric algorithm
TELE-INFO'11/MINO'11/SIP'11 Proceedings of the 10th WSEAS international conference on Telecommunications and informatics and microelectronics, nanoelectronics, optoelectronics, and WSEAS international conference on Signal processing
LEMON - an Open Source C++ Graph Template Library
Electronic Notes in Theoretical Computer Science (ENTCS)
Cutting graphs using competing ant colonies and an edge clustering heuristic
EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization
Speed dating: an algorithmic case study involving matching and scheduling
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
BFS solution for disjoint paths in P systems
UC'11 Proceedings of the 10th international conference on Unconventional computation
Solving maximum flow problems on real-world bipartite graphs
Journal of Experimental Algorithmics (JEA)
A distributed mincut/maxflow algorithm combining path augmentation and push-relabel
EMMCVPR'11 Proceedings of the 8th international conference on Energy minimization methods in computer vision and pattern recognition
Approximating the smallest 2-vertex connected spanning subgraph of a directed graph
ESA'11 Proceedings of the 19th European conference on Algorithms
Maximum flows by incremental breadth-first search
ESA'11 Proceedings of the 19th European conference on Algorithms
Compression and denoising using l0-norm
Computational Optimization and Applications
Design, implementation, and analysis of maximum transversal algorithms
ACM Transactions on Mathematical Software (TOMS)
The reduction and fusion of fuzzy covering systems based on the evidence theory
International Journal of Approximate Reasoning
Parallel implementations of gusfield's cut tree algorithm
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part I
Combinatorial Continuous Maximum Flow
SIAM Journal on Imaging Sciences
Network flow for collaborative ranking
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
A distributed preflow-push for the maximum flow problem
IICS'05 Proceedings of the 5th international conference on Innovative Internet Community Systems
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Counting and sampling minimum (s,t)-cuts in weighted planar graphs in polynomial time
Theoretical Computer Science
On the minimal steiner tree subproblem and its application in branch-and-price
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
The layered net surface problems in discrete geometry and medical image segmentation
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Minimum-cost optimization in multicommodity logistic chain network
IWMM'04/GIAE'04 Proceedings of the 6th international conference on Computer Algebra and Geometric Algebra with Applications
Minimum cuts and shortest non-separating cycles via homology covers
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Identifying websites with flow simulation
ICWE'05 Proceedings of the 5th international conference on Web Engineering
A push-relabel algorithm for approximating degree bounded MSTs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Submodular integer cover and its application to production planning
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Solving multilabel MRFs using incremental α-expansion on the GPUs
ACCV'09 Proceedings of the 9th Asian conference on Computer Vision - Volume Part III
Multipath routing algorithms for congestion minimization
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
A simple and fast min-cut algorithm
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
From static code distribution to more shrinkage for the multiterminal cut
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Domain decomposition methods with graph cuts algorithms for total variation minimization
Advances in Computational Mathematics
Dinitz' algorithm: the original version and even's version
Theoretical Computer Science
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
A golden ratio parameterized algorithm for cluster editing
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Computing minimum multiway cuts in hypergraphs from hypertree packings
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
A computational study of the capacity scaling algorithm for the maximum flow problem
Computers and Operations Research
Group detection and relation analysis research for web social network
APWeb'12 Proceedings of the 14th international conference on Web Technologies and Applications
Optimal cuts in graphs and statistical mechanics
Mathematical and Computer Modelling: An International Journal
An energy-aware dynamic RWA framework for next-generation wavelength-routed networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Computer Science Review
A primal-dual method for approximating tree cover with two weights
Discrete Optimization
Exploiting planarity in separation routines for the symmetric traveling salesman problem
Discrete Optimization
Aggregation of monotone reciprocal relations with application to group decision making
Fuzzy Sets and Systems
Separation of partition inequalities with terminals
Discrete Optimization
Constructing the minimization diagram of a two-parameter problem
Operations Research Letters
Operations Research Letters
On project scheduling with irregular starting time costs
Operations Research Letters
A fast algorithm for minimum weight odd circuits and cuts in planar graphs
Operations Research Letters
A two-phase greedy algorithm to locate and allocate hubs for fixed-wireless broadband access
Operations Research Letters
An optimal time---space algorithm for dense stereo matching
Journal of Real-Time Image Processing
Minimizing Energies with Hierarchical Costs
International Journal of Computer Vision
Graph Sparsification by Effective Resistances
SIAM Journal on Computing
Decomposition of binary images-A survey and comparison
Pattern Recognition
Contraction network for solving maximum flow problem
Proceedings of the ACM SIGKDD Workshop on Mining Data Semantics
A golden ratio parameterized algorithm for Cluster Editing
Journal of Discrete Algorithms
Improved multiple sequence alignments using coupled pattern mining
Proceedings of the ACM Conference on Bioinformatics, Computational Biology and Biomedicine
Enabling mobile distributed social networking on smartphones
Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Improving Graph Cuts algorithm to transform sequence of stereo image to depth map
Journal of Systems and Software
Topology optimisation of repairable flow networks for a maximum average availability
Computers & Mathematics with Applications
A survey of graph theoretical approaches to image segmentation
Pattern Recognition
Maximum flow networks for stability analysis of LEGO®Structures
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
An overview of algorithms for network survivability
ISRN Communications and Networking
Generalized Optimal Response Time Retrieval of Replicated Data from Storage Arrays
ACM Transactions on Storage (TOS)
Efficient relay deployment for controlling connectivity in delay tolerant mobile networks
Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems
Computer Vision and Image Understanding
GPU accelerated maximum cardinality matching algorithms for bipartite graphs
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
Game-theoretic question selection for tests
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Deterministic galois: on-demand, portable and parameterless
Proceedings of the 19th international conference on Architectural support for programming languages and operating systems
Optimal local community detection in social networks based on density drop of subgraphs
Pattern Recognition Letters
Improved Multiple Sequence Alignments Using Coupled Pattern Mining
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Detecting, segmenting and tracking unknown objects using multi-label MRF inference
Computer Vision and Image Understanding
Computer Vision and Image Understanding
The maximum flow problem of uncertain network
Information Sciences: an International Journal
Watertight scenes from urban LiDar and planar surfaces
SGP '13 Proceedings of the Eleventh Eurographics/ACMSIGGRAPH Symposium on Geometry Processing
Hi-index | 0.08 |
All previously known efficient maximum-flow algorithms work by finding augmenting paths, either one path at a time (as in the original Ford and Fulkerson algorithm) or all shortest-length augmenting paths at once (using the layered network approach of Dinic). An alternative method based on the preflow concept of Karzanov is introduced. A preflow is like a flow, except that the total amount flowing into a vertex is allowed to exceed the total amount flowing out. The method maintains a preflow in the original network and pushes local flow excess toward the sink along what are estimated to be shortest paths. The algorithm and its analysis are simple and intuitive, yet the algorithm runs as fast as any other known method on dense graphs, achieving an O(n3) time bound on an n-vertex graph. By incorporating the dynamic tree data structure of Sleator and Tarjan, we obtain a version of the algorithm running in O(nm log(n2/m)) time on an n-vertex, m-edge graph. This is as fast as any known method for any graph density and faster on graphs of moderate density. The algorithm also admits efficient distributed and parallel implementations. A parallel implementation running in O(n2log n) time using n processors and O(m) space is obtained. This time bound matches that of the Shiloach-Vishkin algorithm, which also uses n processors but requires O(n2) space.