Efficient algorithms for finding maximum matching in graphs

Authors:
Zvi Galil
Affiliations:
Columbia Univ., New York, NY/ and Tel-Aviv Univ., Tel-Aviv, Israel
Venue:
ACM Computing Surveys (CSUR)
Year:
1986

Citing 12
Cited 76

Data structures and network algorithms

Data structures and network algorithms
An O(EV log V) algorithm for finding a maximal weighted matching in general graphs

SIAM Journal on Computing
Constructing a perfect matching is in random NC

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Efficiency of a Good But Not Linear Set Union Algorithm

Journal of the ACM (JACM)
An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs

Journal of the ACM (JACM)
Efficient Algorithms for Shortest Paths in Sparse Networks

Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
A linear-time algorithm for a special case of disjoint set union

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Implementation of algorithms for maximum matching on nonbipartite graphs.

Implementation of algorithms for maximum matching on nonbipartite graphs.

3-D Object Recognition Using Bipartite Matching Embedded in Discrete Relaxation

IEEE Transactions on Pattern Analysis and Machine Intelligence
An automatic technique for detecting type conflicts in database schemes

Proceedings of the seventh international conference on Information and knowledge management
The ellipsoidal skeleton in medical applications

Proceedings of the sixth ACM symposium on Solid modeling and applications
Cooperating physical robots: a lesson in playing robotic soccer

Mutli-agents systems and applications
A technique for deriving hyponymies and overlappings from database schemes

Data & Knowledge Engineering
A novel three-level architecture for large data warehouses

Journal of Systems Architecture: the EUROMICRO Journal
Uniform Techniques for Deriving Similarities of Objects and Subschemes in Heterogeneous Databases

IEEE Transactions on Knowledge and Data Engineering
X-Compass: An XML Agent for Supporting User Navigation on the Web

FQAS '02 Proceedings of the 5th International Conference on Flexible Query Answering Systems
Minimal CDMA Recoding Strategies in Power-Controlled Ad-Hoc Wireless Networks

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Deriving Type Conflicts and Object Cluster Similarities in Database Schemes by an Automatic and Semantic Approach

ADBIS '99 Proceedings of the Third East European Conference on Advances in Databases and Information Systems
Cooperating Physical Robots: A Lesson in Playing Robotic Soccer

EASSS '01 Selected Tutorial Papers from the 9th ECCAI Advanced Course ACAI 2001 and Agent Link's 3rd European Agent Systems Summer School on Multi-Agent Systems and Applications
Deriving ``Sub-source'' Similarities from Heterogeneous, Semi-structured Information Sources

CooplS '01 Proceedings of the 9th International Conference on Cooperative Information Systems
Autoplex: Automated Discovery of Content for Virtual Databases

CooplS '01 Proceedings of the 9th International Conference on Cooperative Information Systems
Paralle Approximation Algorithms for Maximum Weighted Matching in General Graphs

TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
All Separating Triangles in a Plane Graph Can Be Optimally "Broken" in Polynomial Time

WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Semi-automatic Extraction of Hyponymies and Overlappings from Heterogeneous Database Schemes

DEXA '00 Proceedings of the 11th International Conference on Database and Expert Systems Applications
An evaluation of bipartitioning techniques

ARVLSI '95 Proceedings of the 16th Conference on Advanced Research in VLSI (ARVLSI'95)
On Overlapping Partitions

ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
A Technique for Extracting Sub-source Similarities from Information Sources Having Different Formats

World Wide Web
Circuit partitioning into small sets: a tool to support testing with further applications

EURO-DAC '91 Proceedings of the conference on European design automation
Personnel assignment problem with hierarchical ordering constraints

Computers and Industrial Engineering
A framework for abstracting data sources having heterogeneous representation formats

Data & Knowledge Engineering
A flexible formal framework for masking/demasking faults

Information Sciences—Informatics and Computer Science: An International Journal
A framework for modeling and evaluating automatic semantic reconciliation

The VLDB Journal — The International Journal on Very Large Data Bases
Schema Matching Using Duplicates

ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Knowledge based approach to semantic composition of teams in an organization

Proceedings of the 2005 ACM symposium on Applied computing
An efficient group key establishment in location-aided mobile ad hoc networks

PE-WASUN '05 Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Automatic ontology matching using application semantics

AI Magazine - Special issue on semantic integration
A graph-based approach for extracting terminological properties from information sources with heterogeneous formats

Knowledge and Information Systems
Automatically discovering design patterns and assessing concern separations for applications

Proceedings of the 2006 ACM symposium on Applied computing
Integration of XML schemas at various "severity" levels

Information Systems
A near-optimal real-time hardware scheduler for large cardinality crossbar switches

Proceedings of the 2006 ACM/IEEE conference on Supercomputing
Genetic algorithm for the personnel assignment problem with multiple objectives

Information Sciences: an International Journal
Incremental assignment problem

Information Sciences: an International Journal
An XML-based agent model for supporting user activities on the Web

Web Intelligence and Agent Systems
Comparison of End-to-End Bandwidth Measurement Tools on the 10GigE TeraGrid Backbone

GRID '05 Proceedings of the 6th IEEE/ACM International Workshop on Grid Computing
From graphs to Euclidean virtual worlds: visualization of 3D electronic institutions

ACSC '07 Proceedings of the thirtieth Australasian conference on Computer science - Volume 62
A design flow dedicated to multi-mode architectures for DSP applications

Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Concept similarity in Formal Concept Analysis: An information content approach

Knowledge-Based Systems
Novel pin assignment algorithms for components with very high pin counts

Proceedings of the conference on Design, automation and test in Europe
Angle Optimization in Target Tracking

SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
A two-stage hardware scheduler combining greedy and optimal scheduling

Journal of Parallel and Distributed Computing
Tools and algorithms for refined comparison of protein structures

MINO'07 Proceedings of the 6th conference on Microelectronics, nanoelectronics, optoelectronics
Nearly homogeneous multi-partitioning with a deterministic generator

Neurocomputing
Robust pedestrian detection and tracking in crowded scenes

Image and Vision Computing
A Comparison of Web Service Interface Similarity Measures

Proceedings of the 2006 conference on STAIRS 2006: Proceedings of the Third Starting AI Researchers' Symposium
Content based similarity of geographic classes organized as partition hierarchies

Knowledge and Information Systems
Accelerating reinforcement learning by composing solutions of automatically identified subtasks

Journal of Artificial Intelligence Research
A technique to search for functional similarities in protein-protein interaction networks

International Journal of Data Mining and Bioinformatics
The symmetric travelling salesman problem I. New fast lower bounds for the problem of optimal 2-matching

Automation and Remote Control
A semantic and structural similarity approach to personalize location-based services

DNIS'07 Proceedings of the 5th international conference on Databases in networked information systems
Approximate queries by relaxing structural constraints in GIS

ER'07 Proceedings of the 2007 conference on Advances in conceptual modeling: foundations and applications
Semantics-guided clustering of heterogeneous XML schemas

Journal on data semantics IX
Extraction and exploitation of intensional knowledge from heterogeneous information sources: semi-automatic approaches and tools

Extraction and exploitation of intensional knowledge from heterogeneous information sources: semi-automatic approaches and tools
c-Through: part-time optics in data centers

Proceedings of the ACM SIGCOMM 2010 conference
A similarity assessment method for discovering and adapting business services

International Journal of Computational Science and Engineering
High-level synthesis for designing multimode architectures

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
An application of snap-stabilization: matching in bipartite graphs

ACMOS'07 Proceedings of the 9th WSEAS international conference on Automatic control, modelling and simulation
A random graph model of kidney exchanges: efficiency, individual-rationality and incentives

Proceedings of the 12th ACM conference on Electronic commerce
Identifying refactoring opportunities in process model repositories

Information and Software Technology
On the complexity of core, kernel, and bargaining set

Artificial Intelligence
Automating competence management through non-standard reasoning

Engineering Applications of Artificial Intelligence
On the cardinality of schema matching

OTM'05 Proceedings of the 2005 OTM Confederated international conference on On the Move to Meaningful Internet Systems
Evaluating semantic similarity using GML in geographic information systems

OTM'05 Proceedings of the 2005 OTM Confederated international conference on On the Move to Meaningful Internet Systems
Note on an auction procedure for a matching game in polynomial time

AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Two conditions for reducing the maximal length of node-disjoint paths in hypercubes

Theoretical Computer Science
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
Managing uncertainty in schema matching with top-k schema mappings

Journal on Data Semantics VI
Ontology-based concept similarity in Formal Concept Analysis

Information Sciences: an International Journal
Mechanism design for double auctions with temporal constraints

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Persistency in maximum cardinality bipartite matchings

Operations Research Letters
Scalable genome scaffolding using integer linear programming

Proceedings of the ACM Conference on Bioinformatics, Computational Biology and Biomedicine
Dynamic matchings in convex bipartite graphs

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
RETRAiN: a REcommendation tool for reconfiguration of retail bank branch

ICSOC'12 Proceedings of the 10th international conference on Service-Oriented Computing
Research note: An efficient construction of one-to-many node-disjoint paths in folded hypercubes

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper surveys the techniques used for designing the most efficient algorithms for finding a maximum cardinality or weighted matching in (general or bipartite) graphs. It also lists some open problems concerning possible improvements in existing algorithms and the existence of fast parallel algorithms for these problems.