Finite Domain Constraint Satisfaction Using Quantum Computation
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Efficient Web Searching Using Temporal Factors
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Approximation Algorithms for Survivable Optical Networks
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
On Approximating Minimum Vertex Cover for Graphs with Perfect Matching
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
A Modified Greedy Algorithm for the Set Cover Problem with Weights 1 and 2
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Tight Bounds on Maximal and Maximum Matchings
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Evolutionary Algorithms and the Maximum Matching Problem
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Self-stabilizing Neighborhood Unique Naming under Unfair Scheduler
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
A Highly Efficient Algorithm to Determine Bicritical Graphs
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
An Experimental Study of Data Migration Algorithms
WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
Determining the Number of Solutions to Binary CSP Instances
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
On Claw-Free Asteroidal Triple-Free Graphs
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Messages Scheduling for Parallel Data Redistribution between Clusters
IEEE Transactions on Parallel and Distributed Systems
Matchings in simplicial complexes, circuits and toric varieties
Journal of Combinatorial Theory Series A
Incremental assignment problem
Information Sciences: an International Journal
Extracting constrained 2-interval subsets in 2-interval sets
Theoretical Computer Science
An 0(n2.5) Fault Identification Algorithm for Diagnosable Systems
IEEE Transactions on Computers
Improved Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
A Framework for Hybrid Tractability Results in Boolean Weighted Constraint Satisfaction Problems
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Matching points with rectangles and squares
Computational Geometry: Theory and Applications
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
Journal of Discrete Algorithms
Efficiency in exponential time for domination-type problems
Discrete Applied Mathematics
Generic uniform observability analysis for bilinear systems
Automatica (Journal of IFAC)
Efficient algorithms for the 2-gathering problem
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Finding occurrences of protein complexes in protein-protein interaction graphs
Journal of Discrete Algorithms
On the Maximum Edge Coloring Problem
Approximation and Online Algorithms
Approximation algorithm for maximum edge coloring
Theoretical Computer Science
Efficient algorithms for wavelength assignment on trees of rings
Discrete Applied Mathematics
An algorithm for computing simple k-factors
Information Processing Letters
Consensus answers for queries over probabilistic databases
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the Hardness and Approximability of Planar Biconnectivity Augmentation
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
The symmetric alldiff constraint
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Structural analysis of a fractional matching problem
Discrete Applied Mathematics
Computing Large Matchings in Planar Graphs with Fixed Minimum Degree
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Perfect Matching for Biconnected Cubic Graphs in O(n log2n) Time
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
A modified greedy algorithm for dispersively weighted 3-set cover
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
A 4k2 kernel for feedback vertex set
ACM Transactions on Algorithms (TALG)
Efficient algorithms for the 2-gathering problem
ACM Transactions on Algorithms (TALG)
Finding a maximum matching in a sparse random graph in O(n) expected time
Journal of the ACM (JACM)
Dynamically replicated memory: building reliable systems from nanoscale resistive memories
Proceedings of the fifteenth edition of ASPLOS on Architectural support for programming languages and operating systems
Linear time local improvements for weighted matchings in graphs
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Linear time 1/2 -approximation algorithm for maximum weighted matching in general graphs
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Approximation algorithms for maximum edge coloring problem
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Engineering algorithms for approximate weighted matching
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
ESA'07 Proceedings of the 15th annual European conference on Algorithms
A PTAS for the weighted 2-interval pattern problem over the preceding-and-crossing model
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
The stable roommates problem with globally-ranked pairs
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Efficient algorithms for disjoint matchings among intervals and related problems
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Maintaining a large matching and a small vertex cover
Proceedings of the forty-second ACM symposium on Theory of computing
Parameterized algorithm for eternal vertex cover
Information Processing Letters
Approximating the max-edge-coloring problem
Theoretical Computer Science
Computing large matchings fast
ACM Transactions on Algorithms (TALG)
On the max-weight edge coloring problem
Journal of Combinatorial Optimization
Generating a d-dimensional linear subspace efficiently
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Matchability and k-maximal matchings
Discrete Applied Mathematics
Advanced combinatorial algorithms
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
Triangle-free 2-matchings revisited
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
An application of snap-stabilization: matching in bipartite graphs
ACMOS'07 Proceedings of the 9th WSEAS international conference on Automatic control, modelling and simulation
Dynamic approximate vertex cover and maximum matching
Property testing
Dynamic approximate vertex cover and maximum matching
Property testing
Computing large matchings in planar graphs with fixed minimum degree
Theoretical Computer Science
Consensus models: Computational complexity aspects in modern approaches to the list coloring problem
Theoretical Computer Science
Center stable matchings and centers of cover graphs of distributive lattices
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Solving the chromatic cone clustering problem via minimum spanning sphere
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Linear programming in the semi-streaming model with application to the maximum matching problem
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
On the maximum locally clustered subgraph and some related problems
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Soft constraints of difference and equality
Journal of Artificial Intelligence Research
Graph properties based filtering
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Fast edge colorings with fixed number of colors to minimize imbalance
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
A graph–theoretic approach to steganography
CMS'05 Proceedings of the 9th IFIP TC-6 TC-11 international conference on Communications and Multimedia Security
Efficient algorithms for maximum weight matchings in general graphs with small edge weights
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Quantum algorithms for matching and network flows
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Efficient distributed weighted matchings on trees
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Maximum-Size subgraphs of p4-sparse graphs admitting a perfect matching
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
Computing convex quadrangulations
Discrete Applied Mathematics
RNA multiple structural alignment with longest common subsequences
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
A graph-theoretic network security game
WINE'05 Proceedings of the First international conference on Internet and Network Economics
On Complexity of Protein Structure Alignment Problem under Distance Constraint
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Improved algorithms for largest cardinality 2-interval pattern problem
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Configurations with few crossings in topological graphs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Finding graph matchings in data streams
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Yield enhancement for 3D-stacked memory by redundancy sharing across dies
Proceedings of the International Conference on Computer-Aided Design
Finding exact and maximum occurrences of protein complexes in protein-protein interaction graphs
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Karp-sipser on random graphs with a fixed degree sequence
Combinatorics, Probability and Computing
On solution concepts for matching games
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Off-line admission control for advance reservations in star networks
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Inner rectangular drawings of plane graphs
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Linear kernels in linear time, or how to save k colors in O(n2) steps
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Fractional matching via balls-and-bins
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Complexity of cycle transverse matching problems
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Efficient processing of distance queries in large graphs: a vertex cover approach
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
A near-linear time ε-approximation algorithm for geometric bipartite matching
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Fast matrix rank algorithms and applications
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Restricted vertex multicut on permutation graphs
Discrete Applied Mathematics
Rigging tournament brackets for weaker players
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Research paper: Combinatorial and computational aspects of graph packing and graph decomposition
Computer Science Review
Graph-based data clustering with overlaps
Discrete Optimization
Open shop, satellite communication and a theorem by Egerváry (1931)
Operations Research Letters
On the complexity of the herding attack and some related attacks on hash functions
Designs, Codes and Cryptography
Computing maximum non-crossing matching in convex bipartite graphs
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
A more reliable greedy heuristic for maximum matchings in sparse random graphs
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Paired and altruistic kidney donation in the UK: algorithms and experimentation
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Planarizing gadgets for perfect matching do not exist
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
A combinatoric interpretation of dual variables for weighted matching and f-factors
Theoretical Computer Science
A simple reduction from maximum weight matching to maximum cardinality matching
Information Processing Letters
Dynamic matchings in convex bipartite graphs
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Randomized and approximation algorithms for blue-red matching
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Linear programming in the semi-streaming model with application to the maximum matching problem
Information and Computation
Note: Towards optimal kernel for connected vertex cover in planar graphs
Discrete Applied Mathematics
The euclidean k-supplier problem
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Recovering drawing order of single-stroke handwritten images using probabilistic tabu search
Journal of Mobile Multimedia
Simple deterministic algorithms for fully dynamic maximal matching
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Improved Algorithms for Matching r-Separated Sets with Applications to Protein Structure Alignment
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Improved approximations for TSP with simple precedence constraints
Journal of Discrete Algorithms
Fast matrix rank algorithms and applications
Journal of the ACM (JACM)
Linear-Time Approximation for Maximum Weight Matching
Journal of the ACM (JACM)
Efficient recognition of equimatchable graphs
Information Processing Letters
Structural controllability of switched linear systems
Automatica (Journal of IFAC)
Comprehensive technique for designing and synthesizing TSV fault-tolerant 3D clock trees
Proceedings of the International Conference on Computer-Aided Design
Complexity results for rainbow matchings
Theoretical Computer Science
Decision-theoretic troubleshooting: Hardness of approximation
International Journal of Approximate Reasoning
| Hi-index | 0.01 |
In this paper we present an 0(√|V|ċ|E|) algorithm for finding a maximum matching in general graphs. This algorithm works in 'phases'. In each phase a maximal set of disjoint minimum length augmenting paths is found, and the existing matching is increased along these paths. Our contribution consists in devising a special way of handling blossoms, which enables an O(|E|) implementation of a phase. In each phase, the algorithm grows Breadth First Search trees at all unmatched vertices. When it detects the presence of a blossom, it does not 'shrink' the blossom immediately. Instead, it delays the shrinking in such a way that the first augmenting path found is of minimum length. Furthermore, it achieves the effect of shrinking a blossom by a special labeling procedure which enables it to find an augmenting path through a blossom quickly.